48 search results - page 7 / 10 » focs 2002 |
119
click to vote
FOCS
2002
IEEE
15 years 5 months ago
2002
IEEE
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
150
click to vote
FOCS
2002
IEEE
15 years 5 months ago
2002
IEEE
The Constraint Satisfaction Problem (CSP) provides a common framework for many combinatorial problems. The general CSP is known to be NP-complete; however, certain restrictions on...
124
Voted
FOCS
2002
IEEE
15 years 5 months ago
2002
IEEE
We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough ε, every tester for 3colorability must have query complexity Ω(n)....
FOCS
2002
IEEE
15 years 5 months ago
2002
IEEE
Every compact orientable boundaryless surface M can be cut along simple loops with a common point v0, pairwise disjoint except at v0, so that the resulting surface is a topologica...
FOCS
2002
IEEE
15 years 5 months ago
2002
IEEE
We consider the problem of sampling almost uniformly from the set of contingency tables with given row and column sums, when the number of rows is a constant. Cryan and Dyer [3] h...