Articoli correlati a Logic and Machines: Decision Problems and Complexity:...
Logic and Machines: Decision Problems and Complexity: Proceedings of the Symposium "Rekursive Kombinatorik" held from May 23-28, 1983 at the Institut ... der Universität Münster/Westfalen: 171 - Brossura
Contenuti
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.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Compra nuovo
Visualizza questo articolo
EUR 35,19
EUR 9,70 per la spedizione da Germania a Italia
Destinazione, tempi e costi
Risultati della ricerca per Logic and Machines: Decision Problems and Complexity:...
Foto dell'editore
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
Editore:
Springer Berlin Heidelberg, 1984
ISBN 10: 3540133313
ISBN 13: 9783540133315
Antico o usato
Brossura
Da: Buchpark, Trebbin, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher. Codice articolo 3936913/2
Quantità: 1 disponibili
Immagini fornite dal venditore
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.
Editore:
Berlin / Heidelberg / New York / Tokyo Springer 1984, 1984
ISBN 10: 3540133313
ISBN 13: 9783540133315
Antico o usato
Brossura
Prima edizione
Da: Dieter Eckert, Bremen, Germania
Valutazione del venditore 5 su 5 stelle
VI,456 S. Orig.-Karton. Erste Ausgabe.- (= Lecture notes in computer science , 171).- Gutes Exemplar. Codice articolo 97738
Quantità: 1 disponibili
Immagini fornite dal venditore
Logic and Machines: Decision Problems and Complexity
Print on DemandDa: moluna, Greven, Germania
Valutazione del venditore 4 su 5 stelle
Condizione: 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. Codice articolo 4882141
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Logic and Machines: Decision Problems and Complexity
Editore:
Springer Berlin Heidelberg Mai 1984, 1984
ISBN 10: 3540133313
ISBN 13: 9783540133315
Nuovo
Taschenbuch
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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. Codice articolo 9783540133315
Quantità: 2 disponibili
Immagini fornite dal venditore
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
Editore:
Springer Berlin Heidelberg, 1984
ISBN 10: 3540133313
ISBN 13: 9783540133315
Nuovo
Taschenbuch
Da: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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. Codice articolo 9783540133315
Quantità: 1 disponibili
Immagini fornite dal venditore
Logic and Machines: Decision Problems and Complexity
ISBN 10: 3540133313
ISBN 13: 9783540133315
Nuovo
Taschenbuch
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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. Codice articolo 9783540133315
Quantità: 2 disponibili
Foto dell'editore
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)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. In. Codice articolo ria9783540133315_new
Quantità: Più di 20 disponibili
Foto dell'editore
Logic and Machines: Decision Problems and Complexity : Proceedings of the Symposium "Rekursive Kombinatorik" held from May 23-28, 1983 at the Institut
Da: Chiron Media, Wallingford, Regno Unito
Valutazione del venditore 4 su 5 stelle
PF. Condizione: New. Codice articolo 6666-IUK-9783540133315
Quantità: 10 disponibili
Immagini fornite dal venditore
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)
Da: GuthrieBooks, Spring Branch, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: 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. Codice articolo UTD1482618
Quantità: 1 disponibili
Foto dell'editore
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)
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo ABLIING23Mar3113020160146
Quantità: Più di 20 disponibili