Egon Börger, Gisbert Hasenjaeger, Dieter Rödding (Eds.):
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/Westfahlen.
Lecture Notes in Computer Science 171 Springer 1984, ISBN 3-540-13331-3 BibTeX
@proceedings{DBLP:conf/lam/1983,
editor = {Egon B{\"o}rger and
Gisbert Hasenjaeger and
Dieter R{\"o}dding},
title = {Logic and Machines: Decision Problems and Complexity, Proceedings
of the Symposium "Rekursive Kombinatorik" held from May 23-28,
1983 at the Institut f{\"u}r Mathematische Logik und Grundlagenforschung
der Universit{\"a}t M{\"u}nster/Westfahlen},
booktitle = {Logic and Machines},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {171},
year = {1984},
isbn = {3-540-13331-3},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Complexity
Algorithms
Automata and Machines
Decision Problems
- Stål Aanderaa:
On the solvability of the extended (exist-forall)and(exists-forall*)-Ackermann class with identity.
270-284 BibTeX
- Michael Deutsch:
Reductions for the satisfiability with a simple interpretation of the predicate variable.
285-311 BibTeX
- Martin Fürer:
The computational complexity of the unconstrained limited domino problem (with implications for logical decision problems).
312-319 BibTeX
- Jerzy Tiuryn:
Implicit definability of finite binary trees by sets of equations.
320-332 BibTeX
Spektralproblem
Complexity of Boolean Functions
Copyright © Sat May 16 23:28:29 2009
by Michael Ley (ley@uni-trier.de)
