41 search results - page 2 / 9 » Conditional hardness for satisfiable 3-CSPs |
STOC
2003
ACM
14 years 5 months ago
2003
ACM
For a Boolean formula on n variables, the associated property P is the collection of n-bit strings that satisfy . We study the query complexity of tests that distinguish (with hig...
STOC
1994
ACM
13 years 9 months ago
1994
ACM
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandomnumber generators do not exist. This famous result is ...
CVPR
2007
IEEE
14 years 7 months ago
2007
IEEE
Given any two images taken under different illumination conditions, there always exist a physically realizable object which is consistent with both the images even if the lighting...
PTS
2010
13 years 3 months ago
2010
We present a novel algorithm for test data generation that is based on techniques used in formal software verification. Prominent examples of such formal techniques are symbolic ex...
AIPS
2006
13 years 6 months ago
2006
Recent research in AI Planning is focused on improving the quality of the generated plans. PDDL3 incorporates hard and soft constraints on goals and the plan trajectory. Plan traj...