Articoli correlati a The Graph Isomorphism Problem: Its Structural Complexity
Sinossi
Recently, a variety ofresults on the complexitystatusofthegraph isomorphism problem has been obtained. These results belong to the so-called structural part of Complexity Theory. Our idea behind this book is to summarize such results which might otherwise not be easily accessible in the literature, and also, to give the reader an understanding of the aims and topics in Structural Complexity Theory, in general. The text is basically self contained; the only prerequisite for reading it is some elementary knowledge from Complexity Theory and Probability Theory. It can be used to teach a seminar or a monographic graduate course, but also parts of it (especially Chapter 1) provide a source of examples for a standard graduate course on Complexity Theory. Many people have helped us in different ways III the process of writing this book. Especially, we would like to thank V. Arvind, R.V. Book, E. May ordomo, and the referee who gave very constructive comments. This book project was especially made possible by a DAAD grant in the "Acciones In tegrada" program. The third author has been supported by the ESPRIT project ALCOM-II.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Contenuti
Preliminaries.- 1 Decision Problems, Search Problems, and Counting Problems.- 1.1 NP-Completeness.- 1.1.1 The Classes P and NP.- 1.1.2 Reducibility.- 1.2 Reducing the Construction Problem to the Decision Problem.- 1.3 Counting versus Deciding for Graph Isomorphism.- 1.4 Uniqueness of the Solution.- 1.4.1 Random Reductions.- 1.4.2 Promise Problems.- 1.5 Reducing Multiple Questions to One.- 2 Quantifiers, Games, and Interactive Proofs.- 2.1 The Polynomial-Time Hierarchy.- 2.2 Interactive Proof Systems.- 2.2.1 The Class IP.- 2.2.2 Zero-Knowledge.- 2.3 Probabilistic Classes.- 2.3.1 Probability Amplification.- 2.3.2 The BP-Operator.- 2.3.3 Arthur-Merlin Games.- 2.4 Lowness and Collapses.- 3 Circuits and Sparse Sets.- 3.1 Polynomial Size Circuits.- 3.1.1 Circuits for NP.- 3.1.2 Circuits for Graph Isomorphism.- 3.2 Reductions to Sparse Sets.- 4 Counting Properties.- 4.1 Decision Reduces to Parity.- 4.2 Graph Isomorphism is Low for PP.- 4.3 The Reconstruction Conjecture.
Product Description
Book by Johannes Kobler Uwe Schning Jacobo Toran
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Compra nuovo
Visualizza questo articolo
EUR 75,54
EUR 3,41 per la spedizione in U.S.A.
Destinazione, tempi e costiAltre edizioni note dello stesso titolo
Risultati della ricerca per The Graph Isomorphism Problem: Its Structural Complexity
Immagini fornite dal venditore
The Graph Isomorphism Problem: Its Structural Complexity
Da: ThriftBooksVintage, Tukwila, WA, U.S.A.
Valutazione del venditore 5 su 5 stelle
Hardcover. Condizione: Good. No Jacket. Shelf and handling wear to cover and binding, with general signs of previous use. Wear commensurate with age and use. Former owner's name sticker pasted onto front inside board, otherwise clean and unmarked copy. Light bumping visible to corners of boards and ends of spine strip. Secure packaging for safe delivery. Codice articolo 1048709199
Quantità: 1 disponibili
Immagini fornite dal venditore
The Graph Isomorphism Problem: Its Structural Complexity (Progress in Theoretical Computer Science)
Da: thebookforest.com, San Rafael, CA, U.S.A.
Valutazione del venditore 4 su 5 stelle
Condizione: New. Well packaged and promptly shipped from California. US veteran operated. Codice articolo 1LAGBP001NLT
Quantità: 1 disponibili
Foto dell'editore
The Graph Isomorphism Problem: Its Structural Complexity (Progress in Theoretical Computer Science)
Da: Phatpocket Limited, Waltham Abbey, HERTS, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions. Codice articolo Z1-B-017-02064
Quantità: 1 disponibili
Foto dell'editore
The Graph Isomorphism Problem: Its Structural Complexity (Progress in Theoretical Computer Science)
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo ABLIING23Feb2416190237333
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Graph Isomorphism Problem : Its Structural Complexity
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo 1836179-n
Quantità: Più di 20 disponibili
Foto dell'editore
The Graph Isomorphism Problem (Hardcover)
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
Hardcover. Condizione: new. Hardcover. The graph isomorphism problem belongs to the part of Complexity Theory that focuses on the structure of complexity classes involved in the classification of computational problems and in the relations among them. It consists in deciding whether two given graphs are isomorphic, i.e. whether there is a bijective mapping from the nodes of one graph to the nodes of the second graph such that the edge connections are respected. It is a problem of considerable practical as wen as theoretical importance that is, as of now, unresolved in the sense that no efficient algorithm for it has yet been found. Given this fact, it is natural to ask whether such an algorithm exists at an or whether the problem is intractable. -Be book focuses on this issue and presents several recent results that provide a better understanding of the relative position of the graph isomorphism problem in the class NP as well as in other complexity classes. It also uses the problem to illustrate important concepts in structural complexity, providing a look into the more general theory.'The book is basically self-contained; the only prerequisite for reading it is some elementary knowledge from Complexity Theory and Probability Theory. Its level of presentation makes it eminently suitable for a seminar or graduate course devoted to the problem, or as a rich source of examples for a standard graduate course in Complexity Theory. Our idea behind this book is to summarize such results which might otherwise not be easily accessible in the literature, and also, to give the reader an understanding of the aims and topics in Structural Complexity Theory, in general. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Codice articolo 9780817636807
Quantità: 1 disponibili
Immagini fornite dal venditore
Graph Isomorphism Problem : Its Structural Complexity
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: As New. Unread book in perfect condition. Codice articolo 1836179
Quantità: Più di 20 disponibili
Foto dell'editore
The Graph Isomorphism Problem: Its Structural Complexity (Progress in Theoretical Computer Science)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. In. Codice articolo ria9780817636807_new
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Graph Isomorphism Problem : Its Structural Complexity
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo 1836179-n
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
The Graph Isomorphism Problem
Print on DemandDa: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Buch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Recently, a variety ofresults on the complexitystatusofthegraph isomorphism problem has been obtained. These results belong to the so-called structural part of Complexity Theory. Our idea behind this book is to summarize such results which might otherwise not be easily accessible in the literature, and also, to give the reader an understanding of the aims and topics in Structural Complexity Theory, in general. The text is basically self contained; the only prerequisite for reading it is some elementary knowledge from Complexity Theory and Probability Theory. It can be used to teach a seminar or a monographic graduate course, but also parts of it (especially Chapter 1) provide a source of examples for a standard graduate course on Complexity Theory. Many people have helped us in different ways III the process of writing this book. Especially, we would like to thank V. Arvind, R.V. Book, E. May ordomo, and the referee who gave very constructive comments. This book project was especially made possible by a DAAD grant in the 'Acciones In tegrada' program. The third author has been supported by the ESPRIT project ALCOM-II. 172 pp. Englisch. Codice articolo 9780817636807
Quantità: 2 disponibili