1225 search results - page 38 / 245 » The Instance Complexity Conjecture |
COR
2006
13 years 9 months ago
2006
We are interested in the graph coloring problem. We propose an exact method based on a linear-decomposition of the graph. The complexity of this method is exponential according to...
CIE
2008
Springer
13 years 11 months ago
2008
Springer
Abstract We prove, using a non-standard complexity assumption, that any language in NP has a 1-round (that is, the verifier sends a message to the prover, and the prover sends a me...
FOCS
2003
IEEE
14 years 2 months ago
2003
IEEE
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...
JSAC
1998
13 years 8 months ago
1998
Abstract—The excellent bit error rate performance of new iterative decoding algorithms (e.g., turbodecoding) is achieved at the expense of a computationally burdensome decoding p...
AIIDE
2008
13 years 11 months ago
2008
It is difficult to discover effective behavior for NPCs automatically. For instance, evolutionary methods can learn sophisticated behaviors based on a single objective, but realis...