Order Total (1 Item Items):
Shipping Destination:
Structure Complexity Theory Proceedings (11 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (11)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (7)
- As New, Fine or Near Fine (2)
- Very Good or Good (2)
- Fair or Poor (No further results match this refinement)
- As Described (No further results match this refinement)
Binding
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (6)
- Not Print on Demand (11)
Language (1)
Free Shipping
Seller Location
Seller Rating
-
Structure in Complexity Theory Conference, 4th Annual Conference on: Proceedings
Language: English
Published by IEEE Computer Society Press, 1989
ISBN 10: 0818689587 ISBN 13: 9780818689581
Hardcover. Condition: Good. Ex-Library hardcover no dj (blue boards) with all the usual markings, attachments, and library wear. Text block clean and unmarked. Tight binding.
-
Structure in Complexity Theory, Ninth Annual Conference Proceedings of, IEEE, 28 June-1 July 1994, Amsterdam, the Netherlands.
Language: English
Published by The Institute of Electrical and Electronic Engineers, Inc., 1994
ISBN 10: 0818656727 ISBN 13: 9780818656729
Hardcover. Condition: Very Good. Ex-Library hardcover in very nice condition with all the usual markings and attachments. Text block clean and unmarked. Tight binding.
-
-
-
Condition: As New. Unread book in perfect condition.
-
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)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
US$ 69.77
US$ 15.98 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
US$ 65.65
US$ 20.66 shipping
Ships from United Kingdom to U.S.A.Quantity: 10 available
Add to basketPaperback. Condition: New.
-
Structure in Complexity Theory : Proceedings of the Conference Held at the University of California, Berkeley, June 2-5, 1986
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
US$ 69.06
US$ 20.00 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
Paperback or Softback. Condition: New. Structure in Complexity Theory: Proceedings of the Conference Held at the University of California, Berkeley, June 2-5, 1986. Book.
-
Structure in Complexity Theory : Proceedings of the Conference Held at the University of California, Berkeley, June 2-5, 1986
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
US$ 76.80
US$ 20.00 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
-
Taschenbuch. Condition: 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.
