787 search results - page 60 / 158 » Polynomial Constants are Decidable |
ICALP
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. A simple nonconstructive argument shows that most 3CNF formulas with cn clauses (where c is a large enough constant) are not satisfiable. It is an open question whether ...
AIPS
2009
13 years 9 months ago
2009
A planning problem is k-dependent if each action has at most k pre-conditions on variables unaffected by the action. This concept is well-founded since k is a constant for all but...
DAM
2007
13 years 8 months ago
2007
It is shown that the set of hybrid one-dimensional reversible cellular automata (CA) with the periodic boundary condition is a regular set. This has several important consequences...
STACS
2010
Springer
14 years 3 months ago
2010
Springer
Kabanets and Impagliazzo [KI04] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit ...
ICDT
2009
ACM
14 years 8 months ago
2009
ACM
We study containment and equivalence of (unions of) conjunctive queries on relations annotated with elements of a commutative semiring. Such relations and the semantics of positiv...