Structure Complexity Theory (35 results)
Language: English
Published by The Institute of Electrical and Electronic Engineers, Inc., 1994
- Hardcover
Seller: GuthrieBooks, Spring Branch, TX, U.S.A.GuthrieBooks
Contact seller5-star sellerCondition: Used - Very good
US$ 34.31
US$ 6.99 shippingShips within U.S.A.Quantity: 1 available
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.
- Softcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contact seller5-star sellerCondition: New
US$ 62.67
US$ 2.64 shippingShips within U.S.A.Quantity: Over 20 available
Condition: New.
- Softcover
Seller: BargainBookStores, Grand Rapids, MI, U.S.A.BargainBookStores
Contact seller5-star sellerCondition: New
US$ 65.32
Free ShippingShips within U.S.A.Quantity: 5 available
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.
- Softcover
Seller: California Books, Miami, FL, U.S.A.California Books
Contact seller4-star sellerCondition: New
US$ 68.00
Free ShippingShips within U.S.A.Quantity: Over 20 available
Condition: New.
- Softcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contact seller5-star sellerCondition: Used - As new
US$ 69.31
US$ 2.64 shippingShips within U.S.A.Quantity: Over 20 available
Condition: As New. Unread book in perfect condition.
Language: English
Published by Cambridge University Press, 2017
Series: Lecture Notes in Logic, Book 35 of 39. Book 35 of 39 - Lecture Notes in Logic
- Hardcover
- First Edition
Seller: Prior Books Ltd, Cheltenham, United KingdomPrior Books Ltd
Contact seller5-star sellerCondition: Used - As new
US$ 55.01
US$ 30.71 shippingShips from United Kingdom to U.S.A.Quantity: 2 available
Hardcover. Condition: Like New. First Edition. A firm, square and tight hardback with strong joints, just showing a few very minor hardly noticeable bumps and some mild cosmetic wear. Hence a non-text page is stamped 'damaged'. Despite such this book is actually in nearly new condition. Thus the contents are crisp, fresh and cle…an with no pen-marks. Not from a library so no such stamps or labels. Now offered for sale at a very reasonable price.
- Softcover
Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
Contact seller5-star sellerCondition: New
US$ 69.86
US$ 16.00 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New. In.
- Softcover
Seller: Chiron Media, Wallingford, United KingdomChiron Media
Contact seller5-star sellerCondition: New
US$ 65.73
US$ 20.68 shippingShips from United Kingdom to U.S.A.Quantity: 10 available
Paperback. Condition: New.
- Softcover
Seller: GreatBookPricesUK, Woodford Green, United KingdomGreatBookPricesUK
Contact seller5-star sellerCondition: New
US$ 69.15
US$ 20.03 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New.
- Softcover
Seller: GreatBookPricesUK, Woodford Green, United KingdomGreatBookPricesUK
Contact seller5-star sellerCondition: Used - As new
US$ 76.92
US$ 20.03 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: As New. Unread book in perfect condition.
Condition: Used - Near fine
US$ 76.88
US$ 48.04 shippingShips from France to U.S.A.Quantity: 1 available
Couverture souple. Condition: bon. RO20250311: 2007. In-4. Broché. Etat d'usage, Coins frottés, Coiffe en tête abîmée, Intérieur frais. 725 PAGES - en anglais - nombreuses figures en noir/blanc dans le texte. . . . Classification Dewey : 420-Langue anglaise. Anglo-saxon.
- Softcover
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
US$ 63.02
US$ 72.19 shippingShips from Germany to U.S.A.Quantity: 1 available
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 polynomia…l 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.
More images- Softcover
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
US$ 59.21
US$ 80.07 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: 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 Heid…elberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Language: English
Published by Cambridge University Press, 2017
Series: Lecture Notes in Logic, Book 35 of 39. Book 35 of 39 - Lecture Notes in Logic
- Hardcover
Seller: PBShop.store UK, Fairford, GLOS, United KingdomPBShop.store UK
Contact seller5-star sellerCondition: Used - Very good
US$ 209.43
US$ 7.84 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
HRD. Condition: Used - Very Good. Used - Like New Book. Shipped from UK. Established seller since 2000.
Language: English
Published by Cambridge University Press, 2017
Series: Lecture Notes in Logic, Book 35 of 39. Book 35 of 39 - Lecture Notes in Logic
- Hardcover
Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
Contact seller5-star sellerCondition: New
US$ 242.50
US$ 16.00 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Condition: New. In.
Language: English
Published by Cambridge University Press 2017-08-17, 2017
Series: Lecture Notes in Logic, Book 35 of 39. Book 35 of 39 - Lecture Notes in Logic
- Hardcover
Seller: Chiron Media, Wallingford, United KingdomChiron Media
Contact seller5-star sellerCondition: New
US$ 236.93
US$ 20.68 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Hardcover. Condition: New.
Language: English
Published by Cambridge University Press, 2017
Series: Lecture Notes in Logic, Book 35 of 39. Book 35 of 39 - Lecture Notes in Logic
- Hardcover
Seller: California Books, Miami, FL, U.S.A.California Books
Contact seller4-star sellerCondition: New
US$ 254.00
Free ShippingShips within U.S.A.Quantity: Over 20 available
Condition: New.
Language: English
Published by Cambridge University Press, 2017
Series: Lecture Notes in Logic, Book 35 of 39. Book 35 of 39 - Lecture Notes in Logic
- Hardcover
Seller: Mispah books, Redhill, SURRE, United KingdomMispah books
Contact seller4-star sellerCondition: New
US$ 235.17
US$ 33.38 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Hardcover. Condition: New. NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
Language: English
Published by Cambridge University Press, 2017
Series: Lecture Notes in Logic, Book 35 of 39. Book 35 of 39 - Lecture Notes in Logic
- Hardcover
- First Edition
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, IrelandKennys Bookshop and Art Galleries Ltd.
Contact seller5-star sellerCondition: New
US$ 263.87
US$ 12.01 shippingShips from Ireland to U.S.A.Quantity: 1 available
Condition: New. This groundbreaking, yet accessible book explores the interaction between graph theory and computational complexity using methods from finite model theory. Series: Lecture Notes in Logic. Num Pages: 530 pages, 60 b/w illus. BIC Classification: PBCD; PBD; PBV; UMB; UYA. Category: (P) Professional & Vocational. Dim…ension: 228 x 152. . . 2017. 1st Edition. Hardcover. . . . .
Language: English
Published by Cambridge University Press, GB, 2017
Series: Lecture Notes in Logic, Book 35 of 39. Book 35 of 39 - Lecture Notes in Logic
- Hardcover
Seller: Rarewaves.com USA, London, LONDO, United KingdomRarewaves.com USA
Contact seller5-star sellerCondition: New
US$ 295.85
Free ShippingShips from United Kingdom to U.S.A.Quantity: 1 available
Hardback. Condition: New. Descriptive complexity theory establishes a connection between the computational complexity of algorithmic problems (the computational resources required to solve the problems) and their descriptive complexity (the language resources required to describe the problems). This groundbreaking book approache…s descriptive complexity from the angle of modern structural graph theory, specifically graph minor theory. It develops a 'definable structure theory' concerned with the logical definability of graph theoretic concepts such as tree decompositions and embeddings. The first part starts with an introduction to the background, from logic, complexity, and graph theory, and develops the theory up to first applications in descriptive complexity theory and graph isomorphism testing. It may serve as the basis for a graduate-level course. The second part is more advanced and mainly devoted to the proof of a single, previously unpublished theorem: properties of graphs with excluded minors are decidable in polynomial time if, and only if, they are definable in fixed-point logic with counting.
Language: English
Published by CAMBRIDGE, 2017
Series: Lecture Notes in Logic, Book 35 of 39. Book 35 of 39 - Lecture Notes in Logic
- Hardcover
Seller: moluna, Greven, Germanymoluna
Contact seller5-star sellerCondition: New
US$ 259.63
US$ 56.04 shippingShips from Germany to U.S.A.Quantity: 1 available
Condition: New. This groundbreaking, yet accessible book contains original results on the interaction between graph theory and computational complexity using methods from finite model theory. As well as a wealth of new, previously unpublished results, the author also gives.
Language: English
Published by Cambridge University Press, 2017
Series: Lecture Notes in Logic, Book 35 of 39. Book 35 of 39 - Lecture Notes in Logic
- Hardcover
Seller: Books Puddle, New York, NY, U.S.A.Books Puddle
Contact seller4-star sellerCondition: New
US$ 317.93
US$ 3.99 shippingShips within U.S.A.Quantity: 4 available
Condition: New. pp. 530.
Language: English
Published by Cambridge University Press, 2017
Series: Lecture Notes in Logic, Book 35 of 39. Book 35 of 39 - Lecture Notes in Logic
- Hardcover
Seller: Kennys Bookstore, Olney, MD, U.S.A.Kennys Bookstore
Contact seller5-star sellerCondition: New
US$ 315.90
US$ 10.50 shippingShips within U.S.A.Quantity: 1 available
Condition: New. This groundbreaking, yet accessible book explores the interaction between graph theory and computational complexity using methods from finite model theory. Series: Lecture Notes in Logic. Num Pages: 530 pages, 60 b/w illus. BIC Classification: PBCD; PBD; PBV; UMB; UYA. Category: (P) Professional & Vocational. Dim…ension: 228 x 152. . . 2017. 1st Edition. Hardcover. . . . . Books ship from the US and Ireland.
Language: English
Published by Cambridge University Press Sep 2017, 2017
Series: Lecture Notes in Logic, Book 35 of 39. Book 35 of 39 - Lecture Notes in Logic
- Hardcover
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
US$ 269.45
US$ 73.78 shippingShips from Germany to U.S.A.Quantity: 1 available
Buch. Condition: Neu. Neuware - This groundbreaking, yet accessible book explores the interaction between graph theory and computational complexity using methods from finite model theory.
Language: English
Published by Cambridge University Press, 2017
Series: Lecture Notes in Logic, Book 35 of 39. Book 35 of 39 - Lecture Notes in Logic
- Hardcover
Seller: Revaluation Books, Exeter, United KingdomRevaluation Books
Contact seller5-star sellerCondition: New
US$ 346.80
US$ 16.69 shippingShips from United Kingdom to U.S.A.Quantity: 2 available
Hardcover. Condition: Brand New. 543 pages. 9.00x6.25x1.50 inches. In Stock.
More imagesLanguage: English
Published by Cambridge University Press, 2017
Series: Lecture Notes in Logic, Book 35 of 39. Book 35 of 39 - Lecture Notes in Logic
- Hardcover
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
US$ 286.42
US$ 80.07 shippingShips from Germany to U.S.A.Quantity: 1 available
Buch. Condition: Neu. Descriptive Complexity, Canonisation, and Definable Graph Structure Theory | Martin Grohe | Buch | Lecture Notes in Logic | Gebunden | Englisch | 2017 | Cambridge University Press | EAN 9781107014527 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | A…nbieter: preigu.
Language: English
Published by Cambridge University Press, GB, 2017
Series: Lecture Notes in Logic, Book 35 of 39. Book 35 of 39 - Lecture Notes in Logic
- Hardcover
Seller: Rarewaves.com UK, London, United KingdomRarewaves.com UK
Contact seller5-star sellerCondition: New
US$ 287.52
US$ 86.79 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Hardback. Condition: New. Descriptive complexity theory establishes a connection between the computational complexity of algorithmic problems (the computational resources required to solve the problems) and their descriptive complexity (the language resources required to describe the problems). This groundbreaking book approache…s descriptive complexity from the angle of modern structural graph theory, specifically graph minor theory. It develops a 'definable structure theory' concerned with the logical definability of graph theoretic concepts such as tree decompositions and embeddings. The first part starts with an introduction to the background, from logic, complexity, and graph theory, and develops the theory up to first applications in descriptive complexity theory and graph isomorphism testing. It may serve as the basis for a graduate-level course. The second part is more advanced and mainly devoted to the proof of a single, previously unpublished theorem: properties of graphs with excluded minors are decidable in polynomial time if, and only if, they are definable in fixed-point logic with counting.
Language: English
Published by Springer Berlin Heidelberg, Springer Berlin Heidelberg Mai 1986, 1986
- Softcover
- Print on Demand
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermanyBuchWeltWeit Ludwig Meier e.K.
Contact seller5-star sellerCondition: New
US$ 63.02
US$ 26.31 shippingShips from Germany to U.S.A.Quantity: 2 available
Taschenbuch. Condition: 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.
- Softcover
- Print on Demand
Seller: moluna, Greven, Germanymoluna
Contact seller5-star sellerCondition: New
US$ 56.99
US$ 56.04 shippingShips from Germany to U.S.A.Quantity: Over 20 available
Condition: 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.- Relativi…zed alternation.- The polynomial hierarc.
- Softcover
- Print on Demand
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germanybuchversandmimpf2000
Contact seller5-star sellerCondition: New
US$ 63.02
US$ 68.63 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: 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.- T…he 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 KG, Sachsenplatz 4-6, 1201 Wien 412 pp. Englisch.
