2430 search results - page 191 / 486 » Computing Tutte Polynomials |
163
click to vote
FOCS
1998
IEEE
15 years 11 months ago
1998
IEEE
We show that approximating the shortest vector problem (in any p norm) to within any constant factor less than p 2 is hard for NP under reverse unfaithful random reductions with i...
166
click to vote
FOCS
1994
IEEE
15 years 11 months ago
1994
IEEE
We show that two cooperating robots can learn exactly any strongly-connected directed graph with n indistinguishable nodes in expected time polynomial in n. We introduce a new typ...
177
click to vote
FOCS
2006
IEEE
15 years 10 months ago
2006
IEEE
We consider random 3CNF formulas with n variables and m clauses. It is well known that when m > cn (for a sufficiently large constant c), most formulas are not satisfiable. How...
191
click to vote
CAIP
1995
Springer
15 years 10 months ago
1995
Springer
The Point Distribution Model (PDM) has already proved useful for many tasks involving the location or tracking of deformable objects. A principal limitation lies in the fact that n...
171
click to vote
ISTCS
1995
Springer
15 years 10 months ago
1995
Springer
A low-degree test is a collection of simple, local rules for checking the proximity of an arbitrary function to a lowdegree polynomial. Each rule depends on the function’s value...