2430 search results - page 173 / 486 » Computing Tutte Polynomials |
169
click to vote
JSAT
2010
15 years 1 months ago
2010
Groote and Zantema proved that a particular OBDD computation of the pigeonhole formula has exponential size, and that limited OBDD derivations cannot simulate resolution polynomia...
188
click to vote
EUROGRAPHICS
2010
Eurographics
16 years 1 months ago
2010
Eurographics
Higher-order finite element methods have emerged as an important discretization scheme for simulation. They are increasingly used in contemporary numerical solvers, generating a ...
175
click to vote
COCO
2010
Springer
15 years 8 months ago
2010
Springer
—A space bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space bounded read-write work tapes, and an unbounded stack. Stack Machines with a...
165
click to vote
ECCC
2006
15 years 6 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
139
click to vote
ECCV
2006
Springer
16 years 8 months ago
2006
Springer
Abstract. This paper presents a simple and practical solution to the 6-point 2view focal-length estimation problem. Based on the hidden-variable technique we have derived a 15th de...