13603 search results - page 235 / 2721 » On the Complexity of Computing Treelength |
161
click to vote
MFCS
1997
Springer
15 years 10 months ago
1997
Springer
We prove an exponential lower bound for the length of any resolution proof for the same set of clauses as the one used by Urquhart [13]. Our contribution is a significant simpli...
198
click to vote
STACS
1994
Springer
15 years 10 months ago
1994
Springer
The complexity of the simple maxcut problem is investigated for several special classes of graphs. It is shown that this problem is NP-complete when restricted to one of the follo...
167
Voted
CONEXT
2007
ACM
15 years 9 months ago
2007
ACM
Protocol extensions for a mobile Internet have been developed within the IETF, but a standard design of mobile multicast is still awaited. Multicast routing, when adapting its dis...
162
click to vote
BMVC
2002
15 years 8 months ago
2002
The fusion of images is the process of combining two or more images into a single image retaining important features from each. Fusion is an important technique within many dispar...
185
click to vote
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
We consider random instances of constraint satisfaction problems where each variable has domain size O(1), each constraint is on O(1) variables and the constraints are chosen from...