1092 search results - page 110 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
124
click to vote
COCO
1994
Springer
15 years 10 months ago
1994
Springer
Recent results by Toda, Vinay, Damm, and Valiant have shown that the complexity of the determinant is characterized by the complexity of counting the number of accepting computati...
151
click to vote
SIGECOM
2006
ACM
16 years 1 days ago
2006
ACM
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
178
Voted
KI
2007
Springer
16 years 7 days ago
2007
Springer
Axiom pinpointing has been introduced in description logics (DLs) to help the user understand the reasons why consequences hold by computing minimal subsets of the knowledge base t...
154
click to vote
IROS
2007
IEEE
16 years 12 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...
144
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...