3172 search results - page 29 / 635 » On the Random-Self-Reducibility of Complete Sets |
LPNMR
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. Most complete answer set solvers are based on DPLL. One of the constraint propagation methods is the so-called lookahead, which has been somewhat controversial, due to it...
MFCS
2005
Springer
14 years 4 months ago
2005
Springer
We show the following results regarding complete sets. • NP-complete sets and PSPACE-complete sets are many-one autoreducible. • Complete sets of any level of PH, MODPH, or th...
WOLLIC
2009
Springer
14 years 5 months ago
2009
Springer
A relation between two secrets, known in the literature as nondeducibility, was originally introduced by Sutherland. We extend it to a relation between sets of secrets that we call...
EMNLP
2009
13 years 8 months ago
2009
Set expansion refers to expanding a partial set of "seed" objects into a more complete set. One system that does set expansion is SEAL (Set Expander for Any Language), w...
ISCIS
2004
Springer
14 years 4 months ago
2004
Springer
Partial order methods, such as the stubborn set method and the priority method, reduce verification effort by exploiting irrelevant orders of events. We show how the stubborn set...