57 search results - page 8 / 12 » Generalizations of matched CNF formulas |
120
click to vote
COCO
2010
Springer
15 years 5 months ago
2010
Springer
The last decade has seen a revival of interest in pebble games in the context of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof syst...
128
Voted
IROS
2008
IEEE
15 years 8 months ago
2008
IEEE
— A shell is a body enclosed between two closely spaced and curved surfaces. Classical theory of shells [38], [33], [16] assumes a parametrization along the lines of principal cu...
110
Voted
ICFP
2008
ACM
16 years 1 months ago
2008
ACM
In the context of program verification in an interactive theorem prover, we study the problem of transforming function definitions with ML-style (possibly overlapping) pattern mat...
108
click to vote
CVPR
2006
IEEE
15 years 8 months ago
2006
IEEE
This paper introduces a new representation for planar curves. From the well-known Dirichlet problem for a disk, the harmonic function embedded in a circular disk is solely depende...
184
Voted
MFCS
2010
Springer
15 years 8 days ago
2010
Springer
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...