Artículos relacionados a 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) - Tapa blanda
Comprar nuevo
Ver este artículo
EUR 37,44
EUR 11,00 gastos de envío desde Alemania a España
Destinos, gastos y plazos de envío
Resultados de la búsqueda para Logic and Machines: Decision Problems and Complexity:...
Imagen de archivo
Logic and Machines: Decision Problems and Complexity: Proceedings of the Symposium âRekursive Kombinatorikâ held from May 23â"28, 1983 at the Institut . 171 (Lecture Notes in Computer Science, 171)
Librería: Goldstone Books, Llandybie, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
paperback. Condición: Very Good. All orders are dispatched within one working day from our UK warehouse. We've been selling books online since 2004! We have over 750,000 books in stock. No quibble refund if not completely satisfied. Nº de ref. del artículo: mon0007193362
Cantidad disponible: 1 disponibles
Imagen de archivo
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
Publicado por
Springer Berlin Heidelberg, 1984
ISBN 10: 3540133313
ISBN 13: 9783540133315
Antiguo o usado
Tapa blanda
Librería: Buchpark, Trebbin, Alemania
Calificación del vendedor: 5 de 5 estrellas
Condición: Sehr gut. Zustand: Sehr gut | Seiten: 472 | Sprache: Englisch | Produktart: Bücher. Nº de ref. del artículo: 3936913/2
Cantidad disponible: 1 disponibles
Imagen del vendedor
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.
Publicado por
Berlin / Heidelberg / New York / Tokyo Springer 1984, 1984
ISBN 10: 3540133313
ISBN 13: 9783540133315
Antiguo o usado
Tapa blanda
Original o primera edición
Librería: Dieter Eckert, Bremen, Alemania
Calificación del vendedor: 5 de 5 estrellas
VI,456 S. Orig.-Karton. Erste Ausgabe.- (= Lecture notes in computer science , 171).- Gutes Exemplar. Nº de ref. del artículo: 97738
Cantidad disponible: 1 disponibles
Imagen del vendedor
Logic and Machines: Decision Problems and Complexity
Publicado por
Springer Berlin Heidelberg Mai 1984, 1984
ISBN 10: 3540133313
ISBN 13: 9783540133315
Nuevo
Taschenbuch
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: 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. Nº de ref. del artículo: 9783540133315
Cantidad disponible: 2 disponibles
Imagen de archivo
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)
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. In. Nº de ref. del artículo: ria9783540133315_new
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
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
Publicado por
Springer Berlin Heidelberg, 1984
ISBN 10: 3540133313
ISBN 13: 9783540133315
Nuevo
Taschenbuch
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: 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. Nº de ref. del artículo: 9783540133315
Cantidad disponible: 1 disponibles
Imagen del vendedor
Logic and Machines: Decision Problems and Complexity
Publicado por
Springer Berlin Heidelberg, 1984
ISBN 10: 3540133313
ISBN 13: 9783540133315
Nuevo
Tapa blanda
Librería: moluna, Greven, Alemania
Calificación del vendedor: 5 de 5 estrellas
Condición: 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. Nº de ref. del artículo: 4882141
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Logic and Machines: Decision Problems and Complexity : Proceedings of the Symposium "Rekursive Kombinatorik" held from May 23-28, 1983 at the Institut
Librería: Chiron Media, Wallingford, Reino Unido
Calificación del vendedor: 4 de 5 estrellas
PF. Condición: New. Nº de ref. del artículo: 6666-IUK-9783540133315
Cantidad disponible: 10 disponibles
Imagen del vendedor
Logic and Machines: Decision Problems and Complexity
Publicado por
Springer Berlin Heidelberg, Springer Berlin Heidelberg Mai 1984, 1984
ISBN 10: 3540133313
ISBN 13: 9783540133315
Nuevo
Taschenbuch
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: 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. Nº de ref. del artículo: 9783540133315
Cantidad disponible: 2 disponibles
Imagen del vendedor
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)
Librería: GuthrieBooks, Spring Branch, TX, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Paperback. Condición: 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. Nº de ref. del artículo: UTD1482618
Cantidad disponible: 1 disponibles