2430 search results - page 309 / 486 » Computing Tutte Polynomials |
118
Voted
IPL
2002
15 years 3 months ago
2002
We consider the problem of dualizing a Boolean function f given by CNF, i.e., computing a CNF for its dual fd . While this problem is not solvable in quasi-polynomial total time i...
127
Voted
JSYML
2002
15 years 3 months ago
2002
Abstract. This paper develops the very basic notions of analysis in a weak secondorder theory of arithmetic BTFA whose provably total functions are the polynomial time computable f...
133
Voted
PRL
2007
15 years 3 months ago
2007
Pose estimation has been considered to be an important component in many pattern recognition and computer vision systems. In this paper, we introduce a pose estimation method base...
137
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
In deduction modulo, a theory is not represented by a set of axioms but by a congruence on propositions modulo which the inference rules of standard deductive systems--such as for ...
103
Voted
ICRA
2010
IEEE
15 years 2 months ago
2010
IEEE
— This paper presents a thorough analysis of the computational complexity of optimal reconfiguration planning problem for chain-type modular robots, i.e. finding the least number...