Anbieter: NEPO UG, Rüsselsheim am Main, Deutschland
Taschenbuch. Zustand: Gut. 401 Seiten Sofort verfügbar Versand spätestens am nächsten Arbeitstag Rechnung mit ausgewiesener MwSt. liegt bei daily shipping worldwide with invoice ex library in good condition aus Bibliothek in guten Zustand Sprache: Englisch Gewicht in Gramm: 550.
Sprache: Englisch
Verlag: Cambridge University Press, 2017
ISBN 10: 1107014522 ISBN 13: 9781107014527
Anbieter: Prior Books Ltd, Cheltenham, Vereinigtes Königreich
Erstausgabe
EUR 47,23
Anzahl: 2 verfügbar
In den WarenkorbHardcover. Zustand: 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 clean with no pen-marks. Not from a library so no such stamps or labels. Now offered for sale at a very reasonable price.
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 59,54
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
Couverture souple. Zustand: 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.
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.
Anbieter: preigu, Osnabrück, Deutschland
Taschenbuch. Zustand: 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 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Sprache: Englisch
Verlag: Cambridge University Press, 2017
ISBN 10: 1107014522 ISBN 13: 9781107014527
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 197,01
Anzahl: 1 verfügbar
In den WarenkorbZustand: New. In.
Anbieter: moluna, Greven, Deutschland
Zustand: 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.
Sprache: Englisch
Verlag: Cambridge University Press, 2017
ISBN 10: 1107014522 ISBN 13: 9781107014527
Anbieter: Kennys Bookstore, Olney, MD, USA
Zustand: 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. Dimension: 228 x 152. . . 2017. 1st Edition. Hardcover. . . . . Books ship from the US and Ireland.
Sprache: Englisch
Verlag: Cambridge University Press Sep 2017, 2017
ISBN 10: 1107014522 ISBN 13: 9781107014527
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch. Zustand: Neu. Neuware - This groundbreaking, yet accessible book explores the interaction between graph theory and computational complexity using methods from finite model theory.
Sprache: Englisch
Verlag: Cambridge University Press, 2017
ISBN 10: 1107014522 ISBN 13: 9781107014527
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
EUR 295,33
Anzahl: 2 verfügbar
In den WarenkorbHardcover. Zustand: Brand New. 543 pages. 9.00x6.25x1.50 inches. In Stock.
Sprache: Englisch
Verlag: Cambridge University Press, 2017
ISBN 10: 1107014522 ISBN 13: 9781107014527
Anbieter: preigu, Osnabrück, Deutschland
Buch. Zustand: 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 | Anbieter: preigu.