Importo totale (1 articolo articoli):
Destinazione ordine:
structure complexity theory (37 risultati)
Vai alla pagina principale dei risultati di ricerca
Filtri di ricerca
Tipo di articolo
- Tutti i tipi di prodotto
- Libri (37)
- Riviste e Giornali (Nessun altro risultato corrispondente a questo perfezionamento)
- Fumetti (Nessun altro risultato corrispondente a questo perfezionamento)
- Spartiti (Nessun altro risultato corrispondente a questo perfezionamento)
- Arte, Stampe e Poster (Nessun altro risultato corrispondente a questo perfezionamento)
- Fotografie (Nessun altro risultato corrispondente a questo perfezionamento)
- Mappe (Nessun altro risultato corrispondente a questo perfezionamento)
- Manoscritti e Collezionismo cartaceo (Nessun altro risultato corrispondente a questo perfezionamento)
Condizioni Maggiori informazioni
- Nuovo (29)
- Come nuovo, Ottimo o Quasi ottimo (4)
- Molto buono o Buono (4)
- Discreto o Mediocre (Nessun altro risultato corrispondente a questo perfezionamento)
- Come descritto (Nessun altro risultato corrispondente a questo perfezionamento)
Legatura
Ulteriori caratteristiche
- Prima ed. (2)
- Copia autograf. (Nessun altro risultato corrispondente a questo perfezionamento)
- Sovracoperta (Nessun altro risultato corrispondente a questo perfezionamento)
- Con foto (14)
- Non Print on Demand (28)
Lingua (1)
Spedizione gratuita
Paese del venditore
Valutazione venditore
-
Structure in Complexity Theory Conference, 4th Annual Conference on: Proceedings
Lingua: Inglese
Editore: IEEE Computer Society Press, 1989
ISBN 10: 0818689587 ISBN 13: 9780818689581
Da: GuthrieBooks, Spring Branch, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Hardcover. Condizione: 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.
Lingua: Inglese
Editore: The Institute of Electrical and Electronic Engineers, Inc., 1994
ISBN 10: 0818656727 ISBN 13: 9780818656729
Da: GuthrieBooks, Spring Branch, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Hardcover. Condizione: Very Good. Ex-Library hardcover in very nice condition with all the usual markings and attachments. Text block clean and unmarked. Tight binding.
-
Structure in Complexity Theory : Proceedings of the Conference Held at the University of California, Berkeley, June 2-5, 1986
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
EUR 57,91
Spedizione EUR 2,27
Spedito in U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
-
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)
Da: California Books, Miami, FL, U.S.A.
Valutazione del venditore 4 su 5 stelle
EUR 60,26
Spedizione gratuita
Spedito in U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
-
Structure in Complexity Theory : Proceedings of the Conference Held at the University of California, Berkeley, June 2-5, 1986
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
EUR 61,42
Spedizione EUR 2,27
Spedito in U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
-
Structure in Complexity Theory (Lecture Notes in Computer Science)
Da: NEPO UG, Rüsselsheim am Main, Germania
Valutazione del venditore 5 su 5 stelle
EUR 39,93
Spedizione EUR 24,00
Spedito da Germania a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: 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.
-
Descriptive Complexity, Canonisation, and Definable Graph Structure Theory (Lecture Notes in Logic, Series Number 47)
Libro 35 di 39: Lecture Notes in LogicLingua: Inglese
Editore: Cambridge University Press, 2017
ISBN 10: 1107014522 ISBN 13: 9781107014527
Da: Prior Books Ltd, Cheltenham, Regno Unito
Membro dell'associazione: ABA ILAB PBFA
Valutazione del venditore 4 su 5 stelle
Prima edizione
EUR 47,24
Spedizione EUR 25,23
Spedito da Regno Unito a U.S.A.Quantità: 2 disponibili
Aggiungi al carrelloHardcover. Condizione: 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.
-
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)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 59,56
Spedizione EUR 13,74
Spedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
-
Structure in Complexity Theory: Proceedings of the Conference held at the University of California, Berkeley, June 2-5, 1986 (Lecture Notes in Computer Science)
Da: Chiron Media, Wallingford, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 56,45
Spedizione EUR 17,76
Spedito da Regno Unito a U.S.A.Quantità: 10 disponibili
Aggiungi al carrelloPaperback. Condizione: New.
-
Structure in Complexity Theory : Proceedings of the Conference Held at the University of California, Berkeley, June 2-5, 1986
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 59,38
Spedizione EUR 17,20
Spedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
-
Structure in Complexity Theory : Proceedings of the Conference Held at the University of California, Berkeley, June 2-5, 1986
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 66,00
Spedizione EUR 17,20
Spedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
-
A Course in Phonology - phonetics and phonology, suprasegmental structure, advanced theory, cardinal vowels, sonorant consonants, the timing tier and the great vowel shift, syllable complexity : english phonotactics, tonal phonology, the phenomenon of.
Da: Le-Livre, SABLONS, Francia
Membro dell'associazione: ILAB
Valutazione del venditore 5 su 5 stelle
EUR 65,25
Spedizione EUR 42,00
Spedito da Francia a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloCouverture souple. Condizione: 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.
-
EUR 53,49
Spedizione EUR 63,11
Spedito da Germania a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: 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.
-
EUR 50,25
Spedizione EUR 70,00
Spedito da Germania a U.S.A.Quantità: 5 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: 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.
-
Proceedings: Tenth Annual Structure in Complexity Theory Conference, June 19-22, 1995, Minneapolis, Minnesota/Order Number Pr07052 (STRUCTURE IN COMPLEXITY THEORY CONFERENCE//PROCEEDINGS)
Da: Lexington Books Inc, Idaho Falls, ID, U.S.A.
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: Very Good. Very Good; Contents are tight and clean; some rubbing to middle, top of front cover; Soft Cover; IEEE; 1995; 0.
-
Descriptive Complexity, Canonisation, and Definable Graph Structure Theory (Lecture Notes in Logic, Series Number 47)
Libro 35 di 39: Lecture Notes in LogicLingua: Inglese
Editore: Cambridge University Press, 2017
ISBN 10: 1107014522 ISBN 13: 9781107014527
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 197,06
Spedizione EUR 13,74
Spedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloCondizione: New. In.
-
Descriptive Complexity, Canonisation, and Definable Graph Structure Theory (Lecture Notes in Logic, Series Number 47)
Libro 35 di 39: Lecture Notes in LogicLingua: Inglese
Editore: Cambridge University Press, 2017
ISBN 10: 1107014522 ISBN 13: 9781107014527
Da: California Books, Miami, FL, U.S.A.
Valutazione del venditore 4 su 5 stelle
EUR 225,08
Spedizione gratuita
Spedito in U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
-
Descriptive Complexity, Canonisation, and Definable Graph Structure Theory: 47 (Lecture Notes in Logic, Series Number 47)
Libro 35 di 39: Lecture Notes in LogicLingua: Inglese
Editore: Cambridge University Press 2017-08-17, 2017
ISBN 10: 1107014522 ISBN 13: 9781107014527
Da: Chiron Media, Wallingford, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 203,47
Spedizione EUR 17,76
Spedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: New.
-
Descriptive Complexity, Canonisation, and Definable Graph Structure Theory (Lecture Notes in Logic, Series Number 47)
Libro 35 di 39: Lecture Notes in LogicLingua: Inglese
Editore: Cambridge University Press, 2017
ISBN 10: 1107014522 ISBN 13: 9781107014527
Da: Mispah books, Redhill, SURRE, Regno Unito
Valutazione del venditore 4 su 5 stelle
EUR 201,96
Spedizione EUR 28,67
Spedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: New. NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
-
Lecture Notes in Logic: Series Number 47: Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
Libro 35 di 39: Lecture Notes in LogicLingua: Inglese
Editore: Cambridge University Press, 2017
ISBN 10: 1107014522 ISBN 13: 9781107014527
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Valutazione del venditore 5 su 5 stelle
Prima edizione
EUR 223,95
Spedizione EUR 10,50
Spedito da Irlanda a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloCondizione: 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. . . . .
-
Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
Libro 35 di 39: Lecture Notes in LogicLingua: Inglese
Editore: Cambridge University Press, GB, 2017
ISBN 10: 1107014522 ISBN 13: 9781107014527
Da: Rarewaves.com USA, London, LONDO, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 261,99
Spedizione gratuita
Spedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloHardback. Condizione: 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 approaches 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.
-
Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
Libro 35 di 39: Lecture Notes in LogicEUR 220,36
Spedizione EUR 48,99
Spedito da Germania a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloCondizione: 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.
-
Descriptive Complexity, Canonisation, and Definable Graph Structure Theory (Lecture Notes in Logic)
Libro 35 di 39: Lecture Notes in LogicLingua: Inglese
Editore: Cambridge University Press, 2017
ISBN 10: 1107014522 ISBN 13: 9781107014527
Da: Books Puddle, New York, NY, U.S.A.
Valutazione del venditore 4 su 5 stelle
Condizione: New. pp. 530.
-
Lecture Notes in Logic: Series Number 47: Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
Libro 35 di 39: Lecture Notes in LogicLingua: Inglese
Editore: Cambridge University Press, 2017
ISBN 10: 1107014522 ISBN 13: 9781107014527
Da: Kennys Bookstore, Olney, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: 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.
-
Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
Libro 35 di 39: Lecture Notes in LogicLingua: Inglese
Editore: Cambridge University Press Sep 2017, 2017
ISBN 10: 1107014522 ISBN 13: 9781107014527
EUR 228,69
Spedizione EUR 64,50
Spedito da Germania a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. Neuware - This groundbreaking, yet accessible book explores the interaction between graph theory and computational complexity using methods from finite model theory.
-
Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
Libro 35 di 39: Lecture Notes in LogicLingua: Inglese
Editore: Cambridge University Press, 2017
ISBN 10: 1107014522 ISBN 13: 9781107014527
Da: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 295,41
Spedizione EUR 14,33
Spedito da Regno Unito a U.S.A.Quantità: 2 disponibili
Aggiungi al carrelloHardcover. Condizione: Brand New. 543 pages. 9.00x6.25x1.50 inches. In Stock.
-
Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
Libro 35 di 39: Lecture Notes in LogicLingua: Inglese
Editore: Cambridge University Press, 2017
ISBN 10: 1107014522 ISBN 13: 9781107014527
EUR 243,00
Spedizione EUR 70,00
Spedito da Germania a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloBuch. Condizione: 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.
-
Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
Libro 35 di 39: Lecture Notes in LogicLingua: Inglese
Editore: Cambridge University Press, GB, 2017
ISBN 10: 1107014522 ISBN 13: 9781107014527
Da: Rarewaves.com UK, London, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 246,92
Spedizione EUR 74,53
Spedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloHardback. Condizione: 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 approaches 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.
-
Structure in Complexity Theory
Lingua: Inglese
Editore: Springer Berlin Heidelberg, Springer Berlin Heidelberg Mai 1986, 1986
ISBN 10: 3540164863 ISBN 13: 9783540164869
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
EUR 53,49
Spedizione EUR 23,00
Spedito da Germania a U.S.A.Quantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: 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.
-
Structure in Complexity Theory
Lingua: Inglese
Editore: Springer Berlin Heidelberg, 1986
ISBN 10: 3540164863 ISBN 13: 9783540164869
EUR 48,37
Spedizione EUR 48,99
Spedito da Germania a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: 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.
