Fundamentals of Computation Theory - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

110

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540187400, 9783540481386

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

On the number of keys in relational databases

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-18740-5_99 ◽

1987 ◽

pp. 448-455 ◽

Cited By ~ 1

Author(s):

B. Thalheim

Keyword(s):

Relational Databases

On difficulties of solving a problem of decomposition of the system of boolean equations

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-18740-5_82 ◽

1987 ◽

pp. 386-388

Author(s):

A. A. Safarian

A solving of problems on technological models

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-18740-5_67 ◽

1987 ◽

pp. 314-317 ◽

Cited By ~ 1

Author(s):

V. Ju. Mikhailov

The power of nondeterminism in polynomial-size bounded-width branching programs

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-18740-5_65 ◽

1987 ◽

pp. 302-309 ◽

Cited By ~ 1

Author(s):

Christoph Meinel

Keyword(s):

Branching Programs ◽

Polynomial Size ◽

Bounded Width

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 - Lecture Notes in Computer Science ◽

10.1007/3-540-18740-5_62 ◽

1987 ◽

pp. 293-296

Author(s):

S. A. Lozkin ◽

M. A. Koshkin

Verification of programs with higher-order arrays

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-18740-5_53 ◽

1987 ◽

pp. 251-258

Author(s):

Wojciech Kowalczyk ◽

Paweł Urzyczyn

Keyword(s):

Higher Order

On complexity of computations with limited memory

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-18740-5_48 ◽

1987 ◽

pp. 234-235

Author(s):

N. A. Karpova

Keyword(s):

Limited Memory

Efficient implementation of structural recursion

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-18740-5_43 ◽

1987 ◽

pp. 204-213

Author(s):

K. Indermark ◽

H. Klaeren

Keyword(s):

Efficient Implementation ◽

Structural Recursion

The implicating vector problem and its applications to probabilistic and linear automata

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-18740-5_31 ◽

1987 ◽

pp. 132-136

Author(s):

N. Z. Gabbasov

Keyword(s):

Vector Problem

A simplest probability model of asynchronous iterations

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-18740-5_27 ◽

1987 ◽

pp. 113-115

Author(s):

S. M. Ermakov ◽

A. S. Rasulov

Keyword(s):

Probability Model ◽

Asynchronous Iterations

Fundamentals of Computation Theory - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

On the number of keys in relational databases

On difficulties of solving a problem of decomposition of the system of boolean equations

A solving of problems on technological models

The power of nondeterminism in polynomial-size bounded-width branching programs

On the complexity of realizing some systems of the functions of the algebra of logic by contact and generalized contact circuits

Verification of programs with higher-order arrays

On complexity of computations with limited memory

Efficient implementation of structural recursion

The implicating vector problem and its applications to probabilistic and linear automata

A simplest probability model of asynchronous iterations

Fundamentals of Computation Theory - Lecture Notes in Computer Science
Latest Publications