Da: GuthrieBooks, Spring Branch, TX, U.S.A.
EUR 42,12
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: Very Good. Ex-library paperback in very nice condition with the usual markings and attachments. Text block clean and unmarked. Tight binding.
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
EUR 52,41
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: Best Price, Torrance, CA, U.S.A.
EUR 48,40
Convertire valutaQuantità: 2 disponibili
Aggiungi al carrelloCondizione: New. SUPER FAST SHIPPING.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 58,46
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Da: Chiron Media, Wallingford, Regno Unito
EUR 56,88
Convertire valutaQuantità: 10 disponibili
Aggiungi al carrelloPaperback. Condizione: New.
Editore: Springer Berlin Heidelberg, 1986
ISBN 10: 3540164863 ISBN 13: 9783540164869
Lingua: Inglese
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 53,49
Convertire valutaQuantità: 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.