1998 search results - page 211 / 400 » Complexity of the Cover Polynomial |
163
click to vote
IROS
2007
IEEE
16 years 27 days ago
2007
IEEE
— Motion planning for robotic arms is important for real, physical world applications. The planning for arms with high-degree-of-freedom (DOF) is hard because its search space is...
170
click to vote
EPIA
2005
Springer
16 years 3 days ago
2005
Springer
The paper studies reductions of propositional theories in equilibrium logic to logic programs under answer set semantics. Specifically we are concerned with the question of how to...
148
click to vote
WG
2005
Springer
16 years 2 days ago
2005
Springer
To decide whether a line graph (hence a claw-free graph) of maximum degree five admits a stable cutset has been proven to be an NP-complete problem. The same result has been known...
150
click to vote
ESA
2004
Springer
15 years 12 months ago
2004
Springer
We study polynomials of degree up to 4 over the rationals or a computable real subfield. Our motivation comes from the need to evaluate predicates in nonlinear computational geome...
151
click to vote
FMCAD
2004
Springer
15 years 12 months ago
2004
Springer
This paper describes a new method that is useful in combinational equivalence checking with very challenging industrial designs. The method does not build a miter; instead it build...