1097 search results - page 12 / 220 » Testing Graph Isomorphism |
STACS
1992
Springer
15 years 1 months ago
1992
Springer
We show that the graph isomorphism problem is low for PP and for C=P, i.e., it does not provide a PP or C=P computation with any additional power when used as an oracle. Furthermor...
ECCC
2010
14 years 8 months ago
2010
We study the problem of testing isomorphism (equivalence up to relabelling of the variables) of two Boolean functions f, g : {0, 1}n → {0, 1}. Our main focus is on the most stud...
EXPCS
2007
15 years 1 months ago
2007
Combinatorial optimization problems expressed as Boolean constraint satisfaction problems (BCSPs) arise in several contexts, ranging from the classical unate set-packing problems ...
APPROX
2010
Springer
14 years 11 months ago
2010
Springer
IANDC
2008
14 years 9 months ago
2008
