612 search results - page 71 / 123 » Hardness assumptions in the foundations of theoretical compu... |
CSR
2007
Springer
14 years 2 months ago
2007
Springer
We revisit a well studied linear algebraic problem, computing the rank and determinant of matrices, in order to obtain completeness results for small complexity classes. In partic...
ISAAC
2003
Springer
14 years 1 months ago
2003
Springer
Given a string x and a language L, the Hamming distance of x to L is the minimum Hamming distance of x to any string in L. The edit distance of a string to a language is analogous...
STACS
2010
Springer
14 years 2 months ago
2010
Springer
We call a CNF formula linear if any two clauses have at most one variable in common. We show that there exist unsatisfiable linear k-CNF formulas with at most 4k2 4k clauses, and ...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
— We study the complexity of a class of problems involving satisfying constraints which remain the same under translations in one or more spatial directions. In this paper, we sh...
SPIN
2009
Springer
14 years 2 months ago
2009
Springer
While symmetry reduction has been established to be an important technique for reducing the search space in model checking, its application in concurrent software verification is ...