Items related to Structure in Complexity Theory: Proceedings of the...
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) - Softcover
Synopsis
Book by
"synopsis" may belong to another edition of this title.
- PublisherSpringer
- Publication date1986
- ISBN 10 3540164863
- ISBN 13 9783540164869
- BindingPaperback
- LanguageEnglish
- Number of pages412
- EditorSelman Alan L.
Other Popular Editions of the Same Title
Search results for Structure in Complexity Theory: Proceedings of the...
Stock Image
Structure in Complexity Theory: Proceedings of the Conference held at the University of California, Berkeley, June 2-5, 1986 (Lecture Notes in Computer Science)
Seller: GuthrieBooks, Spring Branch, TX, U.S.A.
Seller rating 5 out of 5 stars
Paperback. Condition: Very Good. Ex-library paperback in very nice condition with the usual markings and attachments. Text block clean and unmarked. Tight binding. Seller Inventory # UTD14a2513
Quantity: 1 available
Stock Image
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)
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # ABLIING23Mar3113020161047
Quantity: Over 20 available
Stock Image
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)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9783540164869_new
Quantity: Over 20 available
Seller Image
Structure in Complexity Theory : Proceedings of the Conference held at the University of California, Berkeley, June 2-5, 1986
Published by
Springer Berlin Heidelberg, 1986
ISBN 10: 3540164863
ISBN 13: 9783540164869
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9783540164869
Quantity: 1 available
Seller Image
Structure in Complexity Theory
Published by
Springer Berlin Heidelberg, 1986
ISBN 10: 3540164863
ISBN 13: 9783540164869
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Condition: 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. Seller Inventory # 4883068
Quantity: Over 20 available
Seller Image
Structure in Complexity Theory
Published by
Springer Berlin Heidelberg, Springer Berlin Heidelberg Mai 1986, 1986
ISBN 10: 3540164863
ISBN 13: 9783540164869
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9783540164869
Quantity: 1 available
Stock Image
Structure in Complexity Theory : Proceedings of the Conference held at the University of California, Berkeley, June 2-5, 1986
Seller: Chiron Media, Wallingford, United Kingdom
Seller rating 5 out of 5 stars
PF. Condition: New. Seller Inventory # 6666-IUK-9783540164869
Quantity: 10 available
Seller Image
Structure in Complexity Theory
Published by
Springer Berlin Heidelberg Mai 1986, 1986
ISBN 10: 3540164863
ISBN 13: 9783540164869
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9783540164869
Quantity: 2 available