C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
Computation Theory and Logic
1987
1987
1987
Keyphrases
Publications
1987
Thomas Lickteig
,
Hugo Volger
Some Results on the Complexity of Powers.
Computation Theory and Logic
(1987)
Dirk Siefkes
Grammars for Terms and Automata - On a book by the late J. Richard Büchi.
Computation Theory and Logic
(1987)
Heinz-Dieter Ebbinghaus
Domino Threads and Complexity.
Computation Theory and Logic
(1987)
Ingo Wegener
The Complexity of Symmetric Boolean Functions.
Computation Theory and Logic
(1987)
Günter Asser
Primitive Recursive Word-Functions of one Variable.
Computation Theory and Logic
(1987)
Erwin Engeler
Modelling of Cooperative Processes.
Computation Theory and Logic
(1987)
Klaus Nökel
,
Robert Rehbold
,
Michael M. Richter
Remarks on SASL and the Verification of Functional Programming Languages.
Computation Theory and Logic
(1987)
Inge Schwank
Alpha-Beta-Gamma - Automata Realizing Preferences.
Computation Theory and Logic
(1987)
Elias Dahlhaus
Skolem Normal Forms Concerning the Least Fixpoint.
Computation Theory and Logic
(1987)
Volker Sperschneider
First Steps towards a Theory of Complexity over more General Data Structures.
Computation Theory and Logic
(1987)
H. Kull
,
Ernst Specker
Direct Construction of Mutually Orthogonal Latin Square.
Computation Theory and Logic
(1987)
Klaus Ambos-Spies
Minimal Pairs for Polynomial Time Reducibilities.
Computation Theory and Logic
(1987)
Elmar Cohors-Fresenborg
The Benefit of Microworlds inLearning Computer Programming.
Computation Theory and Logic
(1987)
Andreas Blass
,
Yuri Gurevich
Existential Fixed-Point Logic.
Computation Theory and Logic
(1987)
Daniele Mundici
.
Computation Theory and Logic
(1987)
Thomas Ottmann
,
Gerald Thiemt
,
Christian P. Ullrich
Numerical Stability of simple Geometric Algorithms in the plane.
Computation Theory and Logic
(1987)
Anne Drosdol
,
Britta Schinzel
Aggregating Inductive Expertise on Partial Recursive Functions.
Computation Theory and Logic
(1987)
Lutz Priese
Communication with Concurrent Systems via I/O-Procedures.
Computation Theory and Logic
(1987)
Egon Börger
Unsolvable Decision Problems for Prolog Programs.
Computation Theory and Logic
(1987)
Klaus W. Wagner
Do There Exist Languages With an Arbitrarily Small Amount of Context-Sensitivity.
Computation Theory and Logic
(1987)
Hans Kleine Büning
,
Theodor Lettmann
Representation Independent Query and Update Operations on Propositional Definite Horn Formulas.
Computation Theory and Logic
(1987)
M. Deutsch
Spectral Representation of Recursively Enumerable and Coenumerable Predicates.
Computation Theory and Logic
(1987)
Hans-Jürgen Brämik
You have not understodd a sentence, unless you can prove it.
Computation Theory and Logic
(1987)
Etienne Grandjean
First-order Spectra with One Variable.
Computation Theory and Logic
(1987)
Daniel E. Cohen
Closure Relations, Buchberger's Algorithm, and Polynomials in Infinitely Many Variables.
Computation Theory and Logic
(1987)
Wilfried Sieg
Relative Konsistenz.
Computation Theory and Logic
(1987)
Helmut Schwichtenberg
Ein einfaches Verfahren zur Normalisierung unendlicher Herleitungen.
Computation Theory and Logic
(1987)
Anne Brüggemann-Klein
,
Rolf Klein
or: Why Löten is Non-Trivial.
Computation Theory and Logic
(1987)
Dieter Spreen
,
Hans Stahl
On the Power of Single-Valued Nondeterministic Polynomial Time Computations.
Computation Theory and Logic
(1987)
Bruno Scarpellini
A Class of EXP-Time Machines which can be Simulated by Polytape Machines.
Computation Theory and Logic
(1987)
Gisbert Hasenjaeger
On the Early History of Register Machines.
Computation Theory and Logic
(1987)
Hans Georg Carstens
A 5-Color-Extension-Theorem.
Computation Theory and Logic
(1987)
Wolfgang A. Slaby
Segment Translation Systems.
Computation Theory and Logic
(1987)
Giorgio Germano
,
Stefano Mazzanti
A Setting for Generalized Computability.
Computation Theory and Logic
(1987)
Wolfgang Thomas
A Concatenation Game and the Dot-Depth Hierarchy.
Computation Theory and Logic
(1987)
Marek Karpinski
,
Rutger Verbeek
Randomness, Provability, and the Seperation of Monte Carlo Time and Space.
Computation Theory and Logic
(1987)
Martin Kummer
Negative Results about the Length Problem.
Computation Theory and Logic
(1987)
volume 270, 1987
Computation Theory and Logic, In Memory of Dieter Rödding
Computation Theory and Logic
270 (1987)