Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 57,94
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: California Books, Miami, FL, U.S.A.
EUR 60,29
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 61,45
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 60,05
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Da: Chiron Media, Wallingford, Regno Unito
EUR 56,92
Quantità: 10 disponibili
Aggiungi al carrelloPaperback. Condizione: New.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 59,88
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Paperback or Softback. Condizione: New. Structure in Complexity Theory: Proceedings of the Conference Held at the University of California, Berkeley, June 2-5, 1986. Book.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 66,59
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 53,49
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. 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.
Da: preigu, Osnabrück, Germania
EUR 50,25
Quantità: 5 disponibili
Aggiungi al carrelloTaschenbuch. 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 | EAN 9783540164869 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Paperback. Condizione: Very Good. Very Good; Contents are tight and clean; some rubbing to middle, top of front cover; Soft Cover; IEEE; 1995; 0.