1199 search results - page 25 / 240 » Parameterized Proof Complexity |
STOC
1998
ACM
14 years 26 days ago
1998
ACM
TAMC
2010
Springer
14 years 6 days ago
2010
Springer
CORR
2010
Springer
13 years 8 months ago
2010
Springer
CORR
2002
Springer
13 years 8 months ago
2002
Springer
Preference elicitation is a central problem in AI, and has received significant attention in single-agent settings. It is also a key problem in multiagent systems, but has receive...
SIAMCOMP
2000
13 years 8 months ago
2000
An exponential lower bound for the size of tree-like cutting planes refutations of a certain family of conjunctive normal form (CNF) formulas with polynomial size resolution refuta...