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
(Sprache: Englisch)
Leider schon ausverkauft
versandkostenfrei
Buch
37.44 €
Produktdetails
Produktinformationen zu „Logic and Machines: Decision Problems and Complexity “
Inhaltsverzeichnis zu „Logic and Machines: Decision Problems and Complexity “
P-mitotic sets.- Equivalence relations, invariants, and normal forms, II.- Recurrence relations for the number of labeled structures on a finite set.- Recursively enumerable extensions of R1 by finite functions.- On the complement of one complexity class in another.- The length-problem.- On r.e. inseparability of CPO index sets.- Arithmetical degrees of index sets for complexity classes.- Rudimentary relations and Turing machines with linear alternation.- A critical-pair/completion algorithm for finitely generated ideals in rings.- Extensible algorithms.- Some reordering properties for inequality proof trees.- Modular decomposition of automata.- Modular machines, undecidability and incompleteness.- Universal Turing machines (UTM) and Jones-Matiyasevich-masking.- Complexity of loop-problems in normed networks.- On the solvability of the extended ?? ? ??? - Ackermann class with identity.- Reductions for the satisfiability with a simple interpretation of the predicate variable.- The computational complexity of the unconstrained limited domino problem (with implications for logical decision problems).- Implicit definability of finite binary trees by sets of equations.- Spektralproblem and completeness of logical decision problems.- Reduction to NP-complete problems by interpretations.- Universal quantifiers and time complexity of random access machines.- Second order spectra.- On the argument complexity of multiply transitive Boolean functions.- The VLSI complexity of Boolean functions.- Fast parallel algorithms for finding all prime implicants for discrete functions.- Bounds for Hodes - Specker theorem.- Proving lower bounds on the monotone complexity of Boolean functions.
Bibliographische Angaben
- Softcover reprint of the original 1st ed. 1984, 472 Seiten, Maße: 15,5 x 23,5 cm, Kartoniert (TB), Englisch
- Herausgegeben: E. Börger, D. Rödding, G. Hasenjaeger
- Verlag: Springer Berlin Heidelberg
- ISBN-10: 3540133313
- ISBN-13: 9783540133315
- Erscheinungsdatum: 01.05.1984
Sprache:
Englisch
Kommentar zu "Logic and Machines: Decision Problems and Complexity"
0 Gebrauchte Artikel zu „Logic and Machines: Decision Problems and Complexity“
Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
---|
Schreiben Sie einen Kommentar zu "Logic and Machines: Decision Problems and Complexity".
Kommentar verfassen