1379 search results - page 131 / 276 » The Complexity of the Annihilating Polynomial |
150
click to vote
ICRA
2005
IEEE
16 years 1 days ago
2005
IEEE
— In this paper we demonstrate path planning for our formation space that represents permutation-invariant multirobot formations. Earlier methods generally pre-assign roles for e...
142
click to vote
LICS
2005
IEEE
16 years 1 days ago
2005
IEEE
In recent work Baader has shown that a certain description logic with conjunction, existential quantification and with circular definitions has a polynomial time subsumption pro...
189
click to vote
IWPEC
2004
Springer
15 years 11 months ago
2004
Springer
We propose to look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with respect to the number of inner points (that is, poi...
128
click to vote
MFCS
2004
Springer
15 years 11 months ago
2004
Springer
Given a fixed computable binary operation , we study the complexity of the following generation problem: The input consists of strings ½ Ò . The question is whether is in the c...
190
click to vote
ICCAD
1999
IEEE
15 years 10 months ago
1999
IEEE
This paper describes a polynomial time algorithm for min-area retiming for edge-triggered circuits to handle both setup and hold constraints. Given a circuit G and a target clock ...