Verwandte Artikel zu Logic and Machines: Decision Problems and Complexity:...
Logic and Machines: Decision Problems and Complexity: Decision Problems and Complexity : Proceedings of the Symposium "Rekursive Kombinatorik" held ... 171 (Lecture Notes in Computer Science) - Softcover
Gebraucht kaufen
Zustand: BefriedigendEx-Library paperback with the usual...
Diesen Artikel anzeigen
EUR 34,90
EUR 5,92 für den Versand innerhalb von/der USA
Versandziele, Kosten & DauerNeu kaufen
Diesen Artikel anzeigen
EUR 47,85
EUR 3,38 für den Versand innerhalb von/der USA
Versandziele, Kosten & Dauer
Suchergebnisse für Logic and Machines: Decision Problems and Complexity:...
Foto des Verkäufers
Logic and Machines: Decision Problems and Complexity: Proceedings of the Symposium ?Rekursive Kombinatorik? held from May 23?28, 1983 at the Institut . (Lecture Notes in Computer Science, 171)
Anbieter: GuthrieBooks, Spring Branch, TX, USA
Verkäuferbewertung 5 von 5 Sternen
Paperback. Zustand: Good. Ex-Library paperback with the usual markings, attachments, and library wear. Pages tanned from age. Except for library markings, interior clean and unmarked. Tight binding. Bestandsnummer des Verkäufers UTD1482618
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Logic and Machines: Decision Problems and Complexity: Proceedings of the Symposium "Rekursive Kombinatorik" held from May 23-28, 1983 at the Institut ... (Lecture Notes in Computer Science, 171)
Anbieter: Lucky's Textbooks, Dallas, TX, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Bestandsnummer des Verkäufers ABLIING23Mar3113020160146
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Logic and Machines: Decision Problems and Complexity: Proceedings of the Symposium "Rekursive Kombinatorik" held from May 23-28, 1983 at the Institut ... (Lecture Notes in Computer Science, 171)
Anbieter: Best Price, Torrance, CA, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. SUPER FAST SHIPPING. Bestandsnummer des Verkäufers 9783540133315
Anzahl: 2 verfügbar
Beispielbild für diese ISBN
Logic and Machines: Decision Problems and Complexity: Proceedings of the Symposium "Rekursive Kombinatorik" held from May 23-28, 1983 at the Institut ... (Lecture Notes in Computer Science, 171)
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. In. Bestandsnummer des Verkäufers ria9783540133315_new
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Logic and Machines: Decision Problems and Complexity : Proceedings of the Symposium "Rekursive Kombinatorik" held from May 23-28, 1983 at the Institut
Anbieter: Chiron Media, Wallingford, Vereinigtes Königreich
Verkäuferbewertung 4 von 5 Sternen
PF. Zustand: New. Bestandsnummer des Verkäufers 6666-IUK-9783540133315
Anzahl: 10 verfügbar
Foto des Verkäufers
Logic and Machines: Decision Problems and Complexity
Verlag:
Springer Berlin Heidelberg Mai 1984, 1984
ISBN 10: 3540133313
ISBN 13: 9783540133315
Neu
Taschenbuch
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -InhaltsangabeP-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. 472 pp. Englisch. Bestandsnummer des Verkäufers 9783540133315
Anzahl: 2 verfügbar
Foto des Verkäufers
Logic and Machines: Decision Problems and Complexity
Print-on-DemandAnbieter: moluna, Greven, Deutschland
Verkäuferbewertung 4 von 5 Sternen
Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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. Bestandsnummer des Verkäufers 4882141
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Logic and machines, decision problems and complexity. Proceedings of the Symposium "Rekursive Kombinatorik" held from May 23-28, 1983 at the Inst. für Mathematische Logik u. Grundlagenforschung d. Universität Münster. Westfalen.
Verlag:
Berlin / Heidelberg / New York / Tokyo Springer 1984, 1984
ISBN 10: 3540133313
ISBN 13: 9783540133315
Gebraucht
Softcover
Erstausgabe
Anbieter: Dieter Eckert, Bremen, Deutschland
Verkäuferbewertung 5 von 5 Sternen
VI,456 S. Orig.-Karton. Erste Ausgabe.- (= Lecture notes in computer science , 171).- Gutes Exemplar. Bestandsnummer des Verkäufers 97738
Anzahl: 1 verfügbar
Foto des Verkäufers
Logic and Machines: Decision Problems and Complexity
ISBN 10: 3540133313
ISBN 13: 9783540133315
Neu
Taschenbuch
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. Neuware -InhaltsangabeP-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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 472 pp. Englisch. Bestandsnummer des Verkäufers 9783540133315
Anzahl: 2 verfügbar
Foto des Verkäufers
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
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - InhaltsangabeP-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. Bestandsnummer des Verkäufers 9783540133315
Anzahl: 1 verfügbar