106 search results - page 8 / 22 » Exponential Time Complexity of the Permanent and the Tutte P... |
105
Voted
IJAC
2007
15 years 12 days ago
2007
The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank...
118
click to vote
ICFP
2007
ACM
16 years 13 days ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
103
Voted
CORR
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. The complexity of maximum likelihood decoding of the ReedSolomon codes [q -1, k]q is a well known open problem. The only known result [4] in this direction states that it...
182
click to vote
FSTTCS
2010
Springer
14 years 9 months ago
2010
Springer
We study (collapsible) higher-order pushdown systems -- theoretically robust and well-studied models of higher-order programs -- along with their natural subclass called (collapsi...
140
Voted
CORR
2002
Springer
15 years 8 days ago
2002
Springer
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...