Computation Theory and Logic - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540181705, 9783540477952

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

First steps towards a theory of complexity over more general data structures

Computation Theory and Logic - Lecture Notes in Computer Science ◽

10.1007/3-540-18170-9_181 ◽

1987 ◽

pp. 391-402

Author(s):

Volker Sperschneider

Keyword(s):

Data Structures ◽

General Data ◽

Theory Of Complexity

Relative konsistenz

Computation Theory and Logic - Lecture Notes in Computer Science ◽

10.1007/3-540-18170-9_179 ◽

1987 ◽

pp. 360-381 ◽

Cited By ~ 1

Author(s):

Wilfried Sieg

A class of exp-time machines which can be simulated by polytape machines

Computation Theory and Logic - Lecture Notes in Computer Science ◽

10.1007/3-540-18170-9_175 ◽

1987 ◽

pp. 306-319

Author(s):

B. Scarpellini

Keyword(s):

Time Machines

Communication with concurrent systems via I/0-procedures

Computation Theory and Logic - Lecture Notes in Computer Science ◽

10.1007/3-540-18170-9_174 ◽

1987 ◽

pp. 294-305

Author(s):

Lutz Priese

Keyword(s):

Concurrent Systems

Representation independent query and update operations on propositional definite Horn formulas

Computation Theory and Logic - Lecture Notes in Computer Science ◽

10.1007/3-540-18170-9_167 ◽

1987 ◽

pp. 208-223 ◽

Cited By ~ 2

Author(s):

Hans Kleine Büning ◽

Theodor Lettmann

Keyword(s):

Horn Formulas

Domino threads and complexity

Computation Theory and Logic - Lecture Notes in Computer Science ◽

10.1007/3-540-18170-9_161 ◽

1987 ◽

pp. 131-142 ◽

Cited By ~ 3

Author(s):

H. -D. Ebbinghaus

Aggregating inductive expertise on partial recursive functions

Computation Theory and Logic - Lecture Notes in Computer Science ◽

10.1007/3-540-18170-9_160 ◽

1987 ◽

pp. 117-130

Author(s):

Anne Drosdol ◽

Britta Schinzel

Keyword(s):

Recursive Functions ◽

Partial Recursive Functions

Closure relations, Buchberger's algorithm, and polynomials in infinitely many variables

Computation Theory and Logic - Lecture Notes in Computer Science ◽

10.1007/3-540-18170-9_156 ◽

1987 ◽

pp. 78-87 ◽

Cited By ~ 5

Author(s):

Daniel E. Cohen

Keyword(s):

Closure Relations

On the power of single-valued nondeterministic polynomial time computations

Computation Theory and Logic - Lecture Notes in Computer Science ◽

10.1007/3-540-18170-9_182 ◽

1987 ◽

pp. 403-414 ◽

Cited By ~ 1

Author(s):

Dieter Spreen ◽

Hans Stahl

Keyword(s):

Polynomial Time

A concatenation game and the dot-depth hierarchy

Computation Theory and Logic - Lecture Notes in Computer Science ◽

10.1007/3-540-18170-9_183 ◽

1987 ◽

pp. 415-426 ◽

Cited By ~ 11

Author(s):

Wolfgang Thomas

Computation Theory and Logic - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

First steps towards a theory of complexity over more general data structures

Relative konsistenz

A class of exp-time machines which can be simulated by polytape machines

Communication with concurrent systems via I/0-procedures

Representation independent query and update operations on propositional definite Horn formulas

Domino threads and complexity

Aggregating inductive expertise on partial recursive functions

Closure relations, Buchberger's algorithm, and polynomials in infinitely many variables

On the power of single-valued nondeterministic polynomial time computations

A concatenation game and the dot-depth hierarchy

Computation Theory and Logic - Lecture Notes in Computer Science
Latest Publications