1225 search results - page 4 / 245 » The Instance Complexity Conjecture |
144
click to vote
SIGAL
1990
15 years 7 months ago
1990
Many intractable problems such as NP-complete problems (provided P = NP) have easy subproblems. In contrast, we investigate the existence and the properties of inherently hard sub...
145
click to vote
LATA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Motivated by strong Karp-Lipton collapse results in bounded arithmetic, Cook and Kraj´ıˇcek [7] have recently introduced the notion of propositional proof systems with...
190
Voted
SIGMOD
2008
ACM
16 years 3 months ago
2008
ACM
Today's query processing engines do not take advantage of the multiple occurrences of a relation in a query to improve performance. Instead, each instance is treated as a dis...
109
click to vote
DATAMINE
2007
15 years 3 months ago
2007
Recent work has looked at extending clustering algorithms with instance level must-link (ML) and cannot-link (CL) background information. Our work introduces δ and ǫ cluster lev...
101
Voted
CP
2008
Springer
15 years 5 months ago
2008
Springer
