Anbieter: GuthrieBooks, Spring Branch, TX, USA
EUR 42,27
Währung umrechnenAnzahl: 1 verfügbar
In den WarenkorbPaperback. Zustand: Very Good. Ex-library paperback in very nice condition with the usual markings and attachments. Text block clean and unmarked. Tight binding.
Anbieter: Lucky's Textbooks, Dallas, TX, USA
EUR 52,59
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 58,32
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
Anbieter: Chiron Media, Wallingford, Vereinigtes Königreich
EUR 56,75
Währung umrechnenAnzahl: 10 verfügbar
In den WarenkorbPaperback. Zustand: New.
Verlag: Springer Berlin Heidelberg, 1986
ISBN 10: 3540164863 ISBN 13: 9783540164869
Sprache: Englisch
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
EUR 53,49
Währung umrechnenAnzahl: 1 verfügbar
In den WarenkorbTaschenbuch. 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.