Lower Bounds for Linear Satisfiability Problems

Lower Bounds for Linear Satisfiability Problems (1999)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Jeff Erickson

Citations:

23 - 9 self

BibTeX

@MISC{Erickson99lowerbounds,
    author = {Jeff Erickson},
    title = {Lower Bounds for Linear Satisfiability Problems},
    year = {1999}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Citations

643	Algorithms in Combinatorial Geometry - Edelsbrunner - 1987
460	A decision method for elementary algebra and geometry - TARSKI - 1951
244	Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms - Edelsbrunner, Mücke - 1990
188	bounds for algebraic computation trees - Lower - 1983
102	Lectures on Polytopes. Volume 152 of Graduate Texts - Ziegler - 1995
99	Some Algebraic and Geometric Computations in PSPACE - Canny - 1988
63	A geometric consistency theorem for a symbolic perturbation scheme - Yap
56	Lower Bounds for Algebraic Decision Trees - Steele, Yao - 1982
51	A general approach to removing degeneracies - Emiris, Canny - 1995
43	Linear decision trees: volume estimates and topological bounds - Björner, Lovász, et al. - 1992
42	Computing road maps in general semi-algebraic sets - Canny - 1993
35	On the Complexity of Computations Under Varying Sets of Primitives - Dobkin, Lipton - 1979
33	On geometric optimization with few violated constraints. Discrete Comput - Matouˇsek - 1995
30	Decision tree complexity and Betti numbers - Yao - 1994
26	New lower bounds for convex hull problems in odd dimensions - Erickson - 1999
24	Better lower bounds on detecting affine and spherical degeneracies - Erickson, Seidel - 1995
23	How good is the information theory bound in sorting? Theor - Fredman - 1976
23	R.: A lower bound for randomized algebraic decision trees - Grigoriev, Karpinski, et al. - 1996
23	Algorithms in real algebraic geometry and applications to computational geometry - Heintz, Recio, et al. - 1991
23	Algebraic decision trees and Euler characteristics - Yao - 1995
19	Filling polyhedral molds - Bose, Kreveld, et al. - 1998
19	Entropy and sorting - Kahn, Kim - 1995
13	Lower bound on testing membership to a polyhedron by algebraic decision and computation trees. Discrete Comput - Grigoriev, Karpinski, et al. - 1997
10	Perfect binary space partitions - Berg, Groot, et al. - 1997
8	On minimum-area hulls - Arkin, Chiang, et al. - 1998
7	How hard are n 2 -hard problems - Bloch, Buss, et al. - 1994
7	Complexity lower bounds for computation trees with elementary transcendental function gates, Theoret - Grigoriev, Vorobjov - 1996
7	Finding an o(n 2 log n) algorithm is sometimes hard - Barrera - 1996
6	Lower bounds for sorting of sums. Theoret - Dietzfelbinger - 1989
5	auf der Heide. A polynomial time linear search algorithm for the n-dimensional knapsack problem - Meyer - 1984
4	Lower bound arguments with “inaccessible” numbers - Dietzfelbinger, Maass - 1988
4	A pseudo-algorithmic separation of lines from pseudo-lines - Steiger, Streinu - 1995
2	Géométrie algébraique réelle, volume12ofErgebnisse der Mathematik und ihrer Grenzgebiete (3 - Bochnak, Coste, et al. - 1987
1	On a class of O(n 2 )problemsin computational geometry - Gajentaan, Overmars - 1995
1	Sorting the sums xi + yi in O(n 2 ) comparisons. Theoret - Lambert - 1992