Etat : 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. N� de r�f. du vendeur 4883068

Contacter le vendeur

Acheter neuf

EUR 48,37

Autre devise

Frais de port : EUR 9,70

De Allemagne vers France

Destinations, frais et d�lais

Quantit� disponible : Plus de 20 disponibles

Ajouter au panier

Image fournie par le vendeur

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

Alan L. Selman

Edit� par Springer Berlin Heidelberg, 1986

ISBN 10 : 3540164863 ISBN 13 : 9783540164869

Neuf Taschenbuch

Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. Etat : 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. N� de r�f. du vendeur 9783540164869

Contacter le vendeur

Acheter neuf

EUR 53,49

Autre devise

Frais de port : EUR 10,99

De Allemagne vers France

Destinations, frais et d�lais

Quantit� disponible : 1 disponible(s)

Ajouter au panier

Image d'archives

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.

Edit� par Springer, 1986

ISBN 10 : 3540164863 ISBN 13 : 9783540164869

Neuf Couverture souple

Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni

�valuation du vendeur 5 sur 5 �toiles

Etat : New. In. N� de r�f. du vendeur ria9783540164869_new

Contacter le vendeur

Acheter neuf

EUR 61,27

Autre devise

Frais de port : EUR 4,67

De Royaume-Uni vers France

Destinations, frais et d�lais

Quantit� disponible : Plus de 20 disponibles

Ajouter au panier

Image fournie par le vendeur

Structure in Complexity Theory

Alan L. Selman

Edit� par Springer Berlin Heidelberg, Springer Berlin Heidelberg Mai 1986, 1986

ISBN 10 : 3540164863 ISBN 13 : 9783540164869

Neuf Taschenbuch

impression � la demande

Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. Etat : 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. N� de r�f. du vendeur 9783540164869

Contacter le vendeur

Acheter neuf

EUR 53,49

Autre devise

Frais de port : EUR 15

De Allemagne vers France

Destinations, frais et d�lais

Quantit� disponible : 1 disponible(s)

Ajouter au panier

Image d'archives

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]

Edit� par Springer, 1986

ISBN 10 : 3540164863 ISBN 13 : 9783540164869

Ancien ou d'occasion Paperback

Vendeur : GuthrieBooks, Spring Branch, TX, Etats-Unis

�valuation du vendeur 5 sur 5 �toiles

Paperback. Etat : Very Good. Ex-library paperback in very nice condition with the usual markings and attachments. Text block clean and unmarked. Tight binding. N� de r�f. du vendeur UTD14a2513

Contacter le vendeur

Acheter D'occasion

EUR 42,83

Autre devise

Frais de port : EUR 56,46

De Etats-Unis vers France

Destinations, frais et d�lais

Quantit� disponible : 1 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Structure in Complexity Theory

Alan L. Selman

Edit� par Springer Berlin Heidelberg Mai 1986, 1986

ISBN 10 : 3540164863 ISBN 13 : 9783540164869

Neuf Taschenbuch

impression � la demande

Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. Etat : 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. N� de r�f. du vendeur 9783540164869

Contacter le vendeur