504 search results - page 44 / 101 » The Complexity of Symmetry-Breaking Formulas |
131
click to vote
JCT
2007
15 years 6 months ago
2007
We show that the complexity of the Markov bases of multidimensional tables stabilizes eventually if a single table dimension is allowed to vary. In particular, if this table dimen...
177
click to vote
MOC
2000
15 years 6 months ago
2000
We treat the time discretization of an initial-value problem for a ous abstract parabolic equation by first using a representation of the solution as an integral along the boundary...
184
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...
183
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
The width of a resolution proof is the maximal number of literals in any clause of the proof. The space of a proof is the maximal number of clauses kept in memory simultaneously if...
165
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
We study the problem of finding the minimum size DNF formula for a function f : {0, 1}d → {0, 1} given its truth table. We show that unless NP ⊆ DTIME(npoly(log n) ), there i...