Structure in Complexity Theory: Proceedings of the Conference held at the University of California, Berkeley, June 2-5, 1986 (Lecture Notes in Computer Science)
Selman, Alan L. [Editor]
ISBN 10: 3540164863 ISBN 13: 9783540164869
Editore: Springer, 1986
Usato
Paperback
Da
GuthrieBooks, Spring Branch, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Venditore AbeBooks dal 1 febbraio 2007
Questo articolo specifico non è più disponibile.
Riguardo questo articolo
Descrizione:
We are unable to ship to Canada at this time.Ex-library paperback in very nice condition with the usual markings and attachments. Text block clean and unmarked. Tight binding. Codice articolo UTD14a2513
Contenuti: The complexity of sparse sets in P.- Isomorphisms and 1-L reductions.- Randomness, relativizations, and polynomial reducibilities.- On non-uniform polynomial space.- One-way functions and circuit complexity.- Relativized alternation.- The polynomial hierarchy and intuitionistic Bounded Arithmetic.- With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy.- The boolean hierarchy: Hardware over NP.- Exponential time and bounded arithmetic.- Probabilistic game automata.- Two lower bound arguments with "inaccessible" numbers.- Resource-bounded Kolmogorov complexity of hard languages.- A note on one-way functions and polynomial time isomorphisms.- What is a hard instance of a computational problem?.- The complexity of optimization problems.- The power of the queue.- A depth-size tradeoff for boolean circuits with unbounded fan-in.- An optimal lower bound for turing machines with one work tape and a two-way input tape.- Separation results for bounded alternation.- Parallel computation with threshold functions.- The topology of provability in complexity theory.- Optimal approximations of complete sets.- Expanders, randomness, or time versus space.- Diagonalisation methods in a polynomial setting.- Bounded oracles and complexity classes inside linear space.- Parallel computation and the NC hierarchy relativized.- Probabilistic quantifiers, adversaries, and complexity classes : An overview.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Dati bibliografici
Titolo: Structure in Complexity Theory: Proceedings ...
Casa editrice: Springer
Data di pubblicazione: 1986
Legatura: Paperback
Condizione: Very Good
I migliori risultati di ricerca su AbeBooks
Immagini fornite dal venditore
Structure in Complexity Theory
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. The complexity of sparse sets in P.- Isomorphisms and 1-L reductions.- Randomness, relativizations, and polynomial reducibilities.- On non-uniform polynomial space.- One-way functions and circuit complexity.- Relativized alternation.- The polynomial hierarc. Codice articolo 4883068
Compra nuovo
EUR 48,37
Spese di spedizione:
EUR 48,99
Da: Germania a: U.S.A.
Quantità: Più di 20 disponibili
Foto dell'editore
Structure in Complexity Theory: Proceedings of the Conference held at the University of California, Berkeley, June 2-5, 1986 (Lecture Notes in Computer Science, 223)
Da: Best Price, Torrance, CA, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. SUPER FAST SHIPPING. Codice articolo 9783540164869
Compra nuovo
EUR 48,88
Spese di spedizione:
EUR 7,75
In U.S.A.
Quantità: 2 disponibili
Structure in Complexity Theory | Proceedings of the Conference held at the University of California, Berkeley, June 2-5, 1986
Da: preigu, Osnabrück, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. Structure in Complexity Theory | Proceedings of the Conference held at the University of California, Berkeley, June 2-5, 1986 | Alan L. Selman | Taschenbuch | viii | Englisch | 1986 | Springer Spektrum | EAN 9783540164869 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. Codice articolo 102150014
Compra nuovo
EUR 50,35
Spese di spedizione:
EUR 70,00
Da: Germania a: U.S.A.
Quantità: 5 disponibili
Foto dell'editore
Structure in Complexity Theory: Proceedings of the Conference held at the University of California, Berkeley, June 2-5, 1986 (Lecture Notes in Computer Science, 223)
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo ABLIING23Mar3113020161047
Compra nuovo
EUR 52,93
Spese di spedizione:
EUR 3,44
In U.S.A.
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Structure in Complexity Theory
ISBN 10: 3540164863
ISBN 13: 9783540164869
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 -The complexity of sparse sets in P.- Isomorphisms and 1-L reductions.- Randomness, relativizations, and polynomial reducibilities.- On non-uniform polynomial space.- One-way functions and circuit complexity.- Relativized alternation.- The polynomial hierarchy and intuitionistic Bounded Arithmetic.- With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy.- The boolean hierarchy: Hardware over NP.- Exponential time and bounded arithmetic.- Probabilistic game automata.- Two lower bound arguments with 'inaccessible' numbers.- Resource-bounded Kolmogorov complexity of hard languages.- A note on one-way functions and polynomial time isomorphisms.- What is a hard instance of a computational problem .- The complexity of optimization problems.- The power of the queue.- A depth-size tradeoff for boolean circuits with unbounded fan-in.- An optimal lower bound for turing machines with one work tape and a two-way input tape.- Separation results for bounded alternation.- Parallel computation with threshold functions.- The topology of provability in complexity theory.- Optimal approximations of complete sets.- Expanders, randomness, or time versus space.- Diagonalisation methods in a polynomial setting.- Bounded oracles and complexity classes inside linear space.- Parallel computation and the NC hierarchy relativized.- Probabilistic quantifiers, adversaries, and complexity classes : An overview. 412 pp. Englisch. Codice articolo 9783540164869
Compra nuovo
EUR 53,49
Spese di spedizione:
EUR 23,00
Da: Germania a: U.S.A.
Quantità: 2 disponibili
Immagini fornite dal venditore
Structure in Complexity Theory : Proceedings of the Conference held at the University of California, Berkeley, June 2-5, 1986
Editore:
Springer Berlin Heidelberg, 1986
ISBN 10: 3540164863
ISBN 13: 9783540164869
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 - The complexity of sparse sets in P.- Isomorphisms and 1-L reductions.- Randomness, relativizations, and polynomial reducibilities.- On non-uniform polynomial space.- One-way functions and circuit complexity.- Relativized alternation.- The polynomial hierarchy and intuitionistic Bounded Arithmetic.- With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy.- The boolean hierarchy: Hardware over NP.- Exponential time and bounded arithmetic.- Probabilistic game automata.- Two lower bound arguments with 'inaccessible' numbers.- Resource-bounded Kolmogorov complexity of hard languages.- A note on one-way functions and polynomial time isomorphisms.- What is a hard instance of a computational problem .- The complexity of optimization problems.- The power of the queue.- A depth-size tradeoff for boolean circuits with unbounded fan-in.- An optimal lower bound for turing machines with one work tape and a two-way input tape.- Separation results for bounded alternation.- Parallel computation with threshold functions.- The topology of provability in complexity theory.- Optimal approximations of complete sets.- Expanders, randomness, or time versus space.- Diagonalisation methods in a polynomial setting.- Bounded oracles and complexity classes inside linear space.- Parallel computation and the NC hierarchy relativized.- Probabilistic quantifiers, adversaries, and complexity classes : An overview. Codice articolo 9783540164869
Compra nuovo
EUR 53,49
Spese di spedizione:
EUR 63,11
Da: Germania a: U.S.A.
Quantità: 1 disponibili
Immagini fornite dal venditore
Structure in Complexity Theory
ISBN 10: 3540164863
ISBN 13: 9783540164869
Nuovo
Taschenbuch
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -The complexity of sparse sets in P.- Isomorphisms and 1-L reductions.- Randomness, relativizations, and polynomial reducibilities.- On non-uniform polynomial space.- One-way functions and circuit complexity.- Relativized alternation.- The polynomial hierarchy and intuitionistic Bounded Arithmetic.- With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy.- The boolean hierarchy: Hardware over NP.- Exponential time and bounded arithmetic.- Probabilistic game automata.- Two lower bound arguments with 'inaccessible' numbers.- Resource-bounded Kolmogorov complexity of hard languages.- A note on one-way functions and polynomial time isomorphisms.- What is a hard instance of a computational problem .- The complexity of optimization problems.- The power of the queue.- A depth-size tradeoff for boolean circuits with unbounded fan-in.- An optimal lower bound for turing machines with one work tape and a two-way input tape.- Separation results for bounded alternation.- Parallel computation with threshold functions.- The topology of provability in complexity theory.- Optimal approximations of complete sets.- Expanders, randomness, or time versus space.- Diagonalisation methods in a polynomial setting.- Bounded oracles and complexity classes inside linear space.- Parallel computation and the NC hierarchy relativized.- Probabilistic quantifiers, adversaries, and complexity classes : An overview.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 412 pp. Englisch. Codice articolo 9783540164869
Compra nuovo
EUR 53,49
Spese di spedizione:
EUR 60,00
Da: Germania a: U.S.A.
Quantità: 1 disponibili
Foto dell'editore
Structure in Complexity Theory: Proceedings of the Conference held at the University of California, Berkeley, June 2-5, 1986 (Lecture Notes in Computer Science)
Da: Chiron Media, Wallingford, Regno Unito
Valutazione del venditore 4 su 5 stelle
Paperback. Condizione: New. Codice articolo 6666-IUK-9783540164869
Compra nuovo
EUR 55,88
Spese di spedizione:
EUR 17,58
Da: Regno Unito a: U.S.A.
Quantità: 10 disponibili
Foto dell'editore
Structure in Complexity Theory: Proceedings of the Conference held at the University of California, Berkeley, June 2-5, 1986 (Lecture Notes in Computer Science, 223)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. In. Codice articolo ria9783540164869_new
Compra nuovo
EUR 57,44
Spese di spedizione:
EUR 13,60
Da: Regno Unito a: U.S.A.
Quantità: Più di 20 disponibili
Foto dell'editore
Structure in Complexity Theory
Da: Books Puddle, New York, NY, U.S.A.
Valutazione del venditore 4 su 5 stelle
Condizione: New. pp. 412. Codice articolo 263105884
Compra nuovo
EUR 187,08
Spese di spedizione:
EUR 3,44
In U.S.A.
Quantità: 4 disponibili