486 search results - page 39 / 98 » Improved upper bounds for 3-SAT |
62
Voted
MFCS
1993
Springer
15 years 1 months ago
1993
Springer
We prove (for fixed k) that at least 1 k−1 (n 2 ) − O(n) equality tests and no more than 2 k (n 2 )+O(n) equality tests are needed in the worst case to determine whether a giv...
80
Voted
FSTTCS
2000
Springer
15 years 1 months ago
2000
Springer
We present a new scheme for storing a planar graph in external memory so that any online path can be traversed in an I-O efficient way. Our storage scheme significantly improves th...
CCCG
2007
14 years 11 months ago
2007
Given a convex polyhedron with n vertices and F faces, what is the fewest number of pieces, each of which unfolds to a simple polygon, into which it may be cut by slices along edg...
55
Voted
IANDC
2010
14 years 8 months ago
2010
We present a polynomial-time algorithm deciding bisimilarity between a normed BPA process and a normed BPP process, with running time O(n7 ). This improves the previously known ex...
109
click to vote
WDAG
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...