Complexity classes of equivalence problems revisited

To determine if two lists of numbers are the same set, we sort both lists and see if we get the same result. The sorted list is a canonical form for the equivalence relation of set equality. Other canonical forms arise in graph isomorphism algorithms. To determine if two graphs are cospectral (have...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Information and computation Ročník 209; číslo 4; s. 748 - 763
Hlavní autoři:	Fortnow, Lance, Grochow, Joshua A.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier Inc 01.04.2011 Elsevier
Témata:	Algorithmics. Computability. Computer arithmetics Applied sciences Canonical form Complexity class Computational complexity Computer science; control theory; systems Equivalence relation Exact sciences and technology Information retrieval. Graph Isomorphism problem Mathematics Miscellaneous Normal form Numerical analysis Numerical analysis. Scientific computation Numerical linear algebra Oracle Probabilistic computation Quantum computation Sciences and techniques of general use Theoretical computing Probabilistic computation Equivalence relation Complexity class Quantum computation Normal form Isomorphism problem Oracle Computational complexity Canonical form Invariant Computer theory Characteristic polynomial Eigenvalue Equivalence classes Graph algorithm
ISSN:	0890-5401, 1090-2651
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!