Lower bounds in a parallel model without bit operations

Lower bounds in a parallel model without bit operations (1997)

Cached

Download Links

[www.cs.uchicago.edu]

Other Repositories/Bibliography

DBLP

by Ketan Mulmuley

Venue:	TO APPEAR IN THE SIAM JOURNAL ON COMPUTING
Citations:	12 - 6 self

BibTeX

@MISC{Mulmuley97lowerbounds,
    author = {Ketan Mulmuley},
    title = {Lower bounds in a parallel model without bit operations},
    year = {1997}
}

Bookmark

OpenURL

Abstract

Citations

1206	Introduction to Parallel Algorithms and Architectures: Arrays - Leighton - 1992
969	Geometric Algorithms and Combinatorial Optimization - Grötschel, Lovász, et al. - 1993
539	A new polynomial-time algorithm for linear programming - Karmarkar - 1984
505	Optimization, approximation, and complexity classes - Papadimitriou, Yannakakis - 1988
391	A new approach to the maximum flow problem - Goldberg, Tarjan
387	Combinatory Optimization: Networks and Matroids - Lawler - 1976
318	Probabilistic computations: Towards a unified measure of complexity - Yao - 1977
308	Quantifier elimination for real closed fields by cylindrical algebraic decomposition - COLLINS - 1975
275	Computational Geometry: An Introduction Through Randomized Algorithms - Mulmuley - 1993
268	Parallel algorithms for sharedmemory machines - Karp, Ramachandran - 1990
264	Ramanujan graphs - Lubotzky, Phillips, et al. - 1988
222	Geometric Invariant Theory - Mumford, Fogarty - 1984
221	Worst-Case Analysis of a New Heuristic for the Traveling Salesman Problem - Christofides - 1976
213	Almost optimal lower bounds for small depth circuits - H˚astad - 1989
188	bounds for algebraic computation trees - Lower - 1983
168	The complexity of finite functions - Boppana, Sipser - 1992
167	Separating the Polynomial-Time Hierarchy by Oracles - Yao - 1985
152	Natural proofs - Razborov, Rudich - 1997
140	Matching is as easy as matrix inversion - Mulmuley, Vazirani, et al. - 1987
139	Synthesis of Parallel Algorithms - Reif - 1993
138	How good is the simplex algorithm - Klee, Minty - 1969
123	Guillemin: Stable Mappings and their Singularities - Golubitsky, V - 1986
121	Lower bounds for the monotone complexity of some boolean functions - Razborov - 1985
116	The monotone circuit complexity of boolean functions - Alon, Boppana - 1987
115	circuits, and the polynomial time hierarchy - FURST, SAXE, et al.
113	On the Betti Numbers of Real Varieties - Milnor - 1964
100	A polynomial algorithm for linear programming - Khachian - 1979
91	A strongly polynomial algorithm to solve combinatorial linear programs - Tardos - 1986
85	Efficient Parallel Solution of Linear Systems - Pan, Reif - 1985
80	Sur l’homologie des varietes algebriques reelles, Differential and Combinatorial - Thom - 1965
77	Matching Theory. Akadémiai Kiadó - Lovász, Plummer - 1986
76	Completeness classes in algebra - Valiant - 1979
74	Fast Parallel Matrix Inversion Algorithms - Csanky - 1976
64	Fast parallel computation of polynomials using few processors, Siam - Valiant, Skyum, et al. - 1983
56	Lower Bounds for Algebraic Decision Trees - Steele, Yao - 1982
56	The complexity of computing the permanent. Theoretical computer science - Valiant - 1979
48	The complexity of computing the permanent, Theoret - Valiant - 1979
45	Global min-cuts in rnc, and other ramifications of a simple min-out algorithm - Karger - 1993
33	V.V.: Matching is as easy as matrix inversion. Combinatorica 7 - Mulmuley, Vazirani, et al. - 1987
28	Polynomial and matrix computations - Bini, Pan - 1994
26	Lower bounds for algebraic computation trees with integer inputs - Yao - 1991
25	A bad network problem for the simplex method and other minimum cost ow algorithms - Zadeh - 1973
19	Constructing a perfect matching is - Karp, Upfal, et al. - 1986
17	An O(n 2 log n) parallel MAX-FLOW algorithm - Shiloach, Vishkin - 1982
16	A fast parallel algorithm for determining all roots of a polynomial with real roots - Ben-Or, Feig, et al. - 1986
16	Computational complexity of parametric linear programming - Murty - 1980
15	Geometric Invariant Theory, 2nd ed - Mumford, Fogarty - 1982
14	Sipser: The complexity of finite functions, Handbook of Theoretical Computer Science, vol - Boppana, M - 1990
14	A note on the parallel complexity of computing the rank of order n matrices - Ibarra, Moran, et al. - 1980
12	The complexity of some problems in parametric linear and combinatorial programming - Carstensen - 1983