Zustand: 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. Bestandsnummer des Verk�ufers 4883068

Verk�ufer kontaktieren

Neu kaufen

EUR 48,37

W�hrung umrechnen

Versand: Gratis

Innerhalb Deutschlands

Versandziele, Kosten & Dauer

Anzahl: Mehr als 20 verf�gbar

In den Warenkorb

Foto des Verk�ufers

Structure in Complexity Theory

Alan L. Selman

Verlag: Springer Berlin Heidelberg, Springer Berlin Heidelberg Mai 1986, 1986

ISBN 10: 3540164863 ISBN 13: 9783540164869

Neu Taschenbuch

Print-on-Demand

Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland

Verk�uferbewertung 5 von 5 Sternen

Taschenbuch. Zustand: 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. Bestandsnummer des Verk�ufers 9783540164869

Verk�ufer kontaktieren

Neu kaufen

EUR 53,49

W�hrung umrechnen

Versand: Gratis

Innerhalb Deutschlands

Versandziele, Kosten & Dauer

Anzahl: 1 verf�gbar

In den Warenkorb

Foto des Verk�ufers

Structure in Complexity Theory : Proceedings of the Conference held at the University of California, Berkeley, June 2-5, 1986

Alan L. Selman

Verlag: Springer Berlin Heidelberg, 1986

ISBN 10: 3540164863 ISBN 13: 9783540164869

Neu Taschenbuch

Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland

Verk�uferbewertung 5 von 5 Sternen

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. Bestandsnummer des Verk�ufers 9783540164869

Verk�ufer kontaktieren

Neu kaufen

EUR 53,49

W�hrung umrechnen

Versand: Gratis

Innerhalb Deutschlands

Versandziele, Kosten & Dauer

Anzahl: 1 verf�gbar

In den Warenkorb

Beispielbild f�r diese ISBN

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)

Selman, Alan L.

Verlag: Springer, 1986

ISBN 10: 3540164863 ISBN 13: 9783540164869

Neu Softcover

Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes K�nigreich

Verk�uferbewertung 5 von 5 Sternen

Zustand: New. In. Bestandsnummer des Verk�ufers ria9783540164869_new

Verk�ufer kontaktieren

Neu kaufen

EUR 61,11

W�hrung umrechnen

Versand: EUR 5,81

Von Vereinigtes K�nigreich nach Deutschland

Versandziele, Kosten & Dauer

Anzahl: Mehr als 20 verf�gbar

In den Warenkorb

Foto des Verk�ufers

Structure in Complexity Theory

Alan L. Selman

Verlag: Springer Berlin Heidelberg Mai 1986, 1986

ISBN 10: 3540164863 ISBN 13: 9783540164869

Neu Taschenbuch

Print-on-Demand

Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland

Verk�uferbewertung 5 von 5 Sternen

Taschenbuch. Zustand: 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. Bestandsnummer des Verk�ufers 9783540164869

Verk�ufer kontaktieren

Neu kaufen

EUR 93,08

W�hrung umrechnen

Versand: Gratis

Innerhalb Deutschlands

Versandziele, Kosten & Dauer

Anzahl: 2 verf�gbar

In den Warenkorb

Beispielbild f�r diese ISBN

Structure in Complexity Theory: Proceedings of the Conference held at the University of California, Berkeley, June 2-5, 1986 (Lecture Notes in Computer Science)

Selman, Alan L. [Editor]

Verlag: Springer, 1986

ISBN 10: 3540164863 ISBN 13: 9783540164869

Gebraucht Paperback

Anbieter: GuthrieBooks, Spring Branch, TX, USA

Verk�uferbewertung 5 von 5 Sternen

Paperback. Zustand: Very Good. Ex-library paperback in very nice condition with the usual markings and attachments. Text block clean and unmarked. Tight binding. Bestandsnummer des Verk�ufers UTD14a2513

Verk�ufer kontaktieren