1920 search results - page 36 / 384 » The Complexity of the A B C Problem |
127
click to vote
ISAAC
2004
Springer
15 years 11 months ago
2004
Springer
In the Paired Pointset Traversal problem we ask whether, given two sets A = {a1, . . . , an} and B = {b1, . . . , bn} in the plane, there is an ordering π of the points such that ...
143
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic by Kamp's theore...
135
click to vote
ICRA
2005
IEEE
15 years 11 months ago
2005
IEEE
— This paper addresses the problem of efficiently computing robot navigation functions. Navigation functions are potential functions free of spurious local minima that present a...
171
click to vote
SIAMCO
2011
15 years 25 days ago
2011
Let R be a commutative complex Banach algebra with the involution ·⋆ and suppose that A ∈ Rn×n , B ∈ Rn×m , C ∈ Rp×n . The question of when the Riccati equation PBB⋆ ...
192
click to vote
FSTTCS
1992
Springer
15 years 10 months ago
1992
Springer
Levin introduced an average-case complexity measure, based on a notion of \polynomialon average," and de ned \average-case polynomial-time many-one reducibility" amongra...