1379 search results - page 156 / 276 » The Complexity of the Annihilating Polynomial |
164
click to vote
EPIA
2005
Springer
15 years 12 months 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...
147
click to vote
WG
2005
Springer
15 years 12 months 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...
148
click to vote
ESA
2004
Springer
15 years 11 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...
147
click to vote
FMCAD
2004
Springer
15 years 11 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...
185
click to vote
NMR
2004
Springer
15 years 11 months ago
2004
Springer
We define the class of head-cycle free nested logic programs, and its proper subclass of acyclic nested programs, generalising similar classes originally defined for disjunctive...