2412 search results - page 123 / 483 » Which Problems Have Strongly Exponential Complexity |
120
click to vote
ICALP
2001
Springer
15 years 7 months ago
2001
Springer
We work with an extension of Resolution, called Res(2), that allows clauses with conjunctions of two literals. In this system there are rules to introduce and eliminate such conju...
143
Voted
MKM
2009
Springer
15 years 10 months ago
2009
Springer
Methods for deciding quantifier-free non-linear arithmetical conjectures over R are crucial in the formal verification of many realworld systems and in formalised mathematics. Wh...
124
Voted
CEC
2009
IEEE
15 years 10 months ago
2009
IEEE
— Many researchers have encountered the problem that the evolution of electronic circuits becomes exponentially more difficult when problems with an increasing number of outputs...
93
Voted
SOFSEM
2004
Springer
15 years 8 months ago
2004
Springer
We initiate a systematic study of the Row Deletion(B) problem on matrices: For a fixed “forbidden submatrix” B, the question is, given an input matrix A (both A and B have ent...
131
click to vote
ALGORITHMICA
2010
15 years 3 months ago
2010
We consider the following version of the stable matching problem. Suppose that men have preferences for women, women have preferences for dogs, and dogs have preferences for men. T...