| Select a publication |
| Show |
Title |
Venue |
Rating |
Date |
|
Lothar Budach.
Arsenals and Lower Bounds.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
R. G. Bukharajev, I. R. Nasirov.
Structur Automata.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
B. A. Buyevich.
On A-Completeness for some Classes of Bounded Determitate Functions.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
Farid M. Ablayev.
Possibilities of Probabilistic on-line Counting Machines.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
Gennady P. Agibalov.
Functional Systems on Semilattices.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
Valery B. Alekseyev.
Recognition of Properties in K-Valued Logic and Approximate Algorithms.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
A. A. Alexanyan.
Linearized Disjunctive Normal Forms of Boolean Functions.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
Ju. A. Al'pin, B. S. Kotchkarev, R. G. Mubarakzianov.
On a Stable Generating of Random Sequences by Probabilistic Automata.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
S. V. Alyoshin.
Automata Classes Induced by Post Classes.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
Alexander E. Andreev.
Effective Lower Bounds for Complexity of Some Classes of Schemes.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
S. A. Bogomolov.
On the Synthesis of "Irredundant" Automata from a Finite Set of Experiments.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
A. V. Anisimov, Vladimir A. Oleshchuk.
Stable Finite Automata Mappings and Church-Rosser Systems.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
A. A. Bolotov.
On the Equivalence Problem of States for Cellular Automata.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
Marat M. Arslanov.
The Recursion Theorem, Approximations, and Classifying Index Sets of Recursively Enumerable Sets.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
A. D. Astakhov.
Duality of Functions and Data in Algorithms Description.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
G. V. Babikov.
On Direct Methods of Realization of Normal Algorithms by Turing Machines.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
D. N. Babin.
Verbal Operation on Automaton.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
A. S. Barashko.
The New Way of Probabilistic Compact Testing.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
M. Yu. Baryshev, L. P. Zhil'tzova, A. A. Markov.
Computational Problems in Alphabetic Coding Theory.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
R. G. Bukharajev, A. I. Enikeev, I. I. Makarov.
Chain-like Model of Programs Communication.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
G. E. Cejtlin, E. L. Jushchenko.
Structure Synthesis of Parallel Programs (Methodology and Tools).
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
Bogdan S. Chlebus, Marek Chrobak, Krzysztof Diks.
Saturating Flows in Networks.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
S. M. Ermakov, B. B. Pokhodzey.
Discrete Analogue of the Neumann Method is not Optimal.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
S. M. Ermakov, A. S. Rasulov.
A Simplest Probability Model of Asynchronous Iterations.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
Yuri Leonidovich Ershov, Sergei S. Goncharov, Dmitri Ivanovich Sviridenko.
Semantic Foundations of Programming.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
N. V. Evtushenko.
Conditions for Existence of Nontrivial Parallel Decompositions of Sequential Machines.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
I. P. Cuhrov.
On the Number of DNF Minimal Relatively Arbitrary Measures of Complexity.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
Jürgen Dassow, Helmut Jürgensen.
Soliton Automata.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
A. B. Frolov.
On the Digital System Diagnostics under Uncertainty.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
N. Z. Gabbasov.
The Implicating Vector Problem and its Applications to Probabilistic and Linear Automata.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
E. E. Gasanov.
Some Asymptotic Evalutions of Complexity of Information Searching.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
S. B. Gashkov.
On the Complexity of Approximate Realization of Continuous Functions by Schemes and Formulas in Continuous Bases.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
Igor Gashkov, V. M. Sidelnikov.
Codes, Connected With a Fraction Linear Functions Group and Their Decoding.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
Dainis Geidmanis.
On the Capabilities of Alternating and Nondeterministic Multitape Automata.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
Alan Gibbons, Wojciech Rytter.
Fast Parallel Algorithms for Optimal Edge-Colouring of some Tree-structured Graphs.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
A. I. Enikeev.
On Development of Dialogue Concurrent Systems.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
M. I. Grinchuk.
On the Complexity of Elementary Periodical Functions Realized by Switching Circuites.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
Hans-Dietrich O. F. Gronau.
Efficient Algorithmic Construction of Designs.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
Hans F. de Groote, Joos Heintz, Stefan Möhler, Heinz Schmidt.
On the Complexity of Lie Algebras.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
I. S. Grunsky.
A Characterization of Sequential Machines by Means of Their Behaviour Fragments.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
Juris Hartmanis.
Some Observations of NP Complete Sets.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
Armin Hemmerling.
Three-Dimensional Traps and Barrages for Cooperating Automata (Extended Abstract).
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
Klaus Indermark, Herbert Klaeren.
Efficient Implementation of Structural Recursion.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
M. A. Iordanskii.
Minimal Numberings of the Vertices of Trees - Approximate Approach.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
K. V. Kolyada.
On the Problem of Completeness for the Regular Mappings.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
A. D. Korshunov.
The Number and the Structure of Typical Sperner and K-Non-Separable Families of Subsets of a Finite Set.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
Matthias Jantzen, Manfred Kudlek, Klaus-Jörn Lange, Holger Petersen.
Dyck
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
Nikolai K. Kossovsky.
A Chriterion of Polynominal Lower Bounds of Combinational Complexity.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
Vadim E. Kotov, Ludmila Cherkasova.
On Generalized Process Logic.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
Stasys Jukna.
Information Flow and Width of Branching Programs (Extended Abstract).
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
Wojciech Kowalczyk, Pawel Urzyczyn.
Verification of Programs with Higher-Order Arrays.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
V. A. Kozlovskiy.
On the Complexity of Analyzing Experiments for Checking local Faults of an Automaton.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
L. M. Karahanjan, Alexander A. Sapozhenko.
On Some Operations of Partial Monotone Boolean Function Simplifying.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
Klaus Kriegel, Stephan Waack.
Exponential Lower Bounds for Real-Time Branching Programs.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
N. A. Karpova.
On Complexity of Computations with Limited Memory.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
V. B. Kudrjavitzev.
On the Conditions of Supplementicity in Functional Systems.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
Nikolai N. Kuzjurin.
On One Approximate Algorithm for Solving Systems of Linear Inequalities with Boolean Variables.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
S. E. Kuznetsov, N. N. Nurmeev, F. I. Salimov.
The Problem of Minimal Implicating Vector.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
R. Kh. Latypov.
Built-in Self-testing of Logic Circuits Using Imperfect Duplication.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
Alexander A. Letichevsky.
Algebras with Approximation and Excursive Data Structures.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
Mikhail Ju. Moshkov.
On the Programs with Finite Development.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
Gerard Tel.
Distributed Infimum Approximation.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
Ildar R. Nasyrov.
The Degrees of Nondeterminism in Pushdown Automata.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
Irina A. Lomazova.
Procedural Implementation of Algebraic Specifications of Abstract Data Types.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
Sergej A. Lozkin, M. A. Koshkin.
On the Complexity of Realizing Some Systems of the Functions of the Algebra of Logic by Contact and Generalized Contact Circuits.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
Sergej A. Lozkin, A. A. Semenov.
On Construction of a Complete System of Compression Functions and on Complexity of Monotone Realization of Threshold Boolean Functions.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
V. N. Noskov.
Statistically Effective Algorithms for Automata Control.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
Yu. Matijasevich.
Diophantine Complexity.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
G. L. Movsisian, Zh. G. Margarian.
D-Representing Code Problem Solution.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
V. I. Pereyaslavsky.
Linear Test Procedures of Recognition.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
Christoph Meinel.
The Power of Nondeterminism in Polynominal-size Bounded-width Branching Programs.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
I. G. Perfilyeva.
Evaluatiobn of Cardinalities of Some Families of -Classes in P
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
M. V. Men'shikov, S. A. Zuev.
Estimation Algorithms of Infinite Graphs Percolation Threshold.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
R. G. Mubarakzianov.
Metric Properties of Random Sequence.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
V. J. Mikhailov.
A Solving of Problems on Technological Models.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
Grigori Mints.
Some Formal Systems of the Logic Programming.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
A. S. Podkolzin.
On the Temporal Complexity of Boolean Mappings Realizations iin Two-dimensional Homogeneous Automata.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
R. I. Podlovcenko.
On Approximate Solution of the Problem of Equivalent Transformations of Programs.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
V. I. Mukhin.
Adaptive Strategies for Partially Observable Controlled Ranom Series.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
L. A. Sholomov.
The Complexity of the Sequential Choice Mechanism.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
Sanguthevar Rajasekaran, John H. Reif.
Ranomized Parallel Computation.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
N. P. Redkin.
On Checking Correctness of Some Classes of Control Systems.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
V. D. Soloviev.
Nondeterministic Finite Algorithmic Procedures as the Models of Abstract Computability.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
V. R. Solovieva.
The Reducibility of Random Sequences by Automata.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
S. A. Stepanov, Igor Shparlinski.
On Structure Complexity of Normal Basis of Finite Field.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
Vladimir Stetsenko.
On Comparison of Boolean Bases.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
Elena Stöhr.
A Tradeoff Between Pagenumber and Width of Book Embedding of Graphs.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
A. S. Strogalov.
On Metric Properties of Automata and Epsilon-Approximation of Automaton Mapping.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
I. K. Rystsov.
The Parallel Complexity of Some Arithemic and Algebraic Operations.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
E. A. Sumenkov.
Algorithmization of Obtaining the Converse Comparison Theorems Based on Solving a Logical Equation.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
A. A. Safarian.
On Difficulties of Solving a Problem of Decomposition of the System of Boolean Equations.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
A. A. Sytnik.
Synthesis of Universal Finite Automats.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
V. A. Taimanov.
On Cartesian Powers of P
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
Daina Taimina.
Complexity Gaps of Turing Machines of Infinite Words.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
Alexander A. Sapozhenko.
The Number of Fuzzy Monotone Functions.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
Bernhard Thalheim.
On the Number of Keys in Relational Databases.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
Vladimir Yu. Sazonov.
Bounded Set Theory and Polynominal Computability.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
A. B. Ugol'nikov.
Complexity and Depth of Formulas Realizing Functions From Closed Classes.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
Dietmar Uhlig.
Reliable Networks from Unreliable Gates With Almost Minimal Complexity.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |
|
Victor L. Selivanov.
Index-Sets of Factor-Objects of the Post Numbering.
|
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings 1987 |
(0)
|
1987 |