Anbieter: medimops, Berlin, Deutschland
Zustand: good. Befriedigend/Good: Durchschnittlich erhaltenes Buch bzw. Schutzumschlag mit Gebrauchsspuren, aber vollständigen Seiten. / Describes the average WORN book or dust jacket that has all the pages present.
Sprache: Englisch
Verlag: IEEE Computer Society Press, 1989
ISBN 10: 0818689587 ISBN 13: 9780818689581
Anbieter: GuthrieBooks, Spring Branch, TX, USA
Hardcover. Zustand: Good. Ex-Library hardcover no dj (blue boards) with all the usual markings, attachments, and library wear. Text block clean and unmarked. Tight binding.
Anbieter: CONTINENTAL MEDIA & BEYOND, Ocala, FL, USA
Zustand: Used: Good. xlibrary rebound paperback bound in hardcasing 1990 withdrawn stamp in book/ on edge of pages clean text 320 pages/// L-18.
Sprache: Englisch
Verlag: The Institute of Electrical and Electronic Engineers, Inc., 1994
ISBN 10: 0818656727 ISBN 13: 9780818656729
Anbieter: GuthrieBooks, Spring Branch, TX, USA
Hardcover. Zustand: Very Good. Ex-Library hardcover in very nice condition with all the usual markings and attachments. Text block clean and unmarked. Tight binding.
Anbieter: Chiron Media, Wallingford, Vereinigtes Königreich
EUR 56,59
Anzahl: 10 verfügbar
In den WarenkorbPaperback. Zustand: New.
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 58,37
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
Sprache: Englisch
Verlag: Springer Berlin Heidelberg, 1986
ISBN 10: 3540164863 ISBN 13: 9783540164869
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: 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.
Paperback. Zustand: Very Good. Very Good; Contents are tight and clean; some rubbing to middle, top of front cover; Soft Cover; IEEE; 1995; 0.
Anbieter: preigu, Osnabrück, Deutschland
Taschenbuch. Zustand: 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 Print on Demand.