search
search
reviewers
reviewers
feeds
feeds
assignments
assignments

settings
logout

Logic and Machines

Keyphrases

Publications

volume 171, 1984

Logic and Machines: Decision Problems and Complexity, Proceedings of the Symposium "Rekursive Kombinatorik" held from May 23-28, 1983 at the Institut für Mathematische Logik und Grundlagenforschung der Universität Münster/Westfalen Logic and Machines 171 (1984)

1983

Christian Blatter, Ernst Specker
Recurrence relations for the number of labeled structures on a finite set. Logic and Machines (1983)
Mark R. Kramer, Jan van Leeuwen
The VLSI complexity of Boolean functions. Logic and Machines (1983)
Gisbert Hasenjaeger
Universal Turing machines (UTM) and Jones-Matijasevich-masking. Logic and Machines (1983)
Klaus Ambos-Spies
P-mitotic sets. Logic and Machines (1983)
Volker Sperschneider
The length-problem. Logic and Machines (1983)
Anne Brüggemann-Klein, Lutz Priese, Dieter Rödding, Rüdiger Schätz
Modular decomposition of automata. Logic and Machines (1983)
Ingo Wegener
Proving lower bounds of the monotone complexity of Boolean functions. Logic and Machines (1983)
Andreas Blass, Yuri Gurevich
Equivalence relations, invariants, and normal forms. Logic and Machines (1983)
Pavel Pudlák
Bounds for Hodes-Specker theorem. Logic and Machines (1983)
Michael M. Richter
Some reordering properties for inequality proof trees. Logic and Machines (1983)
Hugo Volger
Rudimentary relations and Turing machines with linear alternation. Logic and Machines (1983)
Diana Schmidt
On the complement of one complexity class in another. Logic and Machines (1983)
Bruno Scarpellini
Second order spectra. Logic and Machines (1983)
Elias Dahlhaus
Reduction to NP-complete problems by interpretations. Logic and Machines (1983)
Etienne Grandjean
Universal quantifiers and time complexity of random access machines. Logic and Machines (1983)
Ulrich Hedtstück
On the argument complexity of multiply transitive Boolean functions. Logic and Machines (1983)
Hans Kleine Büning
Complexity of loop-problems in normed networks. Logic and Machines (1983)
Bruno Buchberger
A critical-pair/completion algorithm for finitely generated ideals in rings. Logic and Machines (1983)
Dieter Spreen
On r.e. inseparability of CPO index sets. Logic and Machines (1983)
Martin Fürer
The computational complexity of the unconstrained limited domino problem (with implications for logical decision problems). Logic and Machines (1983)
Egon Börger
Spektralproblem and completeness of logical decision problems. Logic and Machines (1983)
Jerzy Tiuryn
Implicit definability of finite binary trees by sets of equations. Logic and Machines (1983)
Walter Oberschelp
Fast parallel algorithms for finding all prime implicants for discrete functions. Logic and Machines (1983)
Kenneth W. Regan
Arithmetical degrees of index sets for complexity classes. Logic and Machines (1983)
Michael Deutsch
Reductions for the satisfiability with a simple interpretation of the predicate variable. Logic and Machines (1983)
Stål Aanderaa
On the solvability of the extended (exist-forall)and(exists-forall*)-Ackermann class with identity. Logic and Machines (1983)
Hans Georg Carstens, Peter Päppinghaus
Extensible algorithms. Logic and Machines (1983)
Wolfgang Menzel, Volker Sperschneider
by finite functions. Logic and Machines (1983)
Daniel E. Cohen
Modular machines, undecidability and incompleteness. Logic and Machines (1983)