Combinatorial Methods In Boolean Function Complexity

Combinatorial Methods In Boolean Function Complexity (1995)

Cached

Download Links

[ftp.cs.uchicago.edu]

Other Repositories/Bibliography

DBLP

by Anna Gál

Citations:

10 - 1 self

BibTeX

@MISC{Gál95combinatorialmethods,
    author = {Anna Gál},
    title = {Combinatorial Methods In Boolean Function Complexity},
    year = {1995}
}

Bookmark

OpenURL

Abstract

Citations

605	Proof Verification and the Hardness of Approximation Problems - Arora, Lund, et al. - 1998
315	The Complexity of Boolean Functions - Wegener - 1987
262	Algebraic methods in the theory of lower bounds for Boolean circuit complexity - Smolensky - 1987
213	Almost optimal lower bounds for small depth circuits - H˚astad - 1989
192	A taxonomy of problems with fast parallel algorithms - Cook - 1985
185	NP is as easy as detecting unique solutions - Valiant, Vazirani - 1986
179	An O(n log n) sorting network - Ajtai, Koml'os, et al. - 1983
142	and Avi Wigderson. Monotone circuits for connectivity require super-logarithmic depth - Karchmer - 1990
140	Matching is as easy as matrix inversion - Mulmuley, Vazirani, et al. - 1987
139	On uniform circuit complexity - Ruzzo - 1981
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.
115	The synthesis of two terminal switching circuits - Shannon - 1949
114	On a problem of K - Kővari, Sós, et al. - 1954
106	On span programs - Karchmer, Wigderson - 1993
103	On computing the determinant in small parallel time using a small number of processors - Berkowitz - 1984
80	Relations among complexity measures - Pippenger, Fischer - 1979
76	CREW PRAMs and decision trees - Nisan - 1991
75	Lower bounds for the size of circuits of bounded depth with basis - Razborov - 1987
71	On Simultaneous Resource Bounds - Pippenger - 1979
68	Wigderson: Monotone Circuits for Matching Require Linear Depth - Raz, A
61	On the tape complexity of deterministic context-free languages - Sudborough - 1978
57	On networks of noisy gates - Pippenger - 1985
55	Tree-size bounded alternation - Ruzzo - 1980
54	Lower bounds for deterministic and nondeterministic branching programs - RAZBOROV - 1991
53	A fast parallel algorithm to compute the rank of a matrix over an arbitrary field - Mulmuley - 1987
49	On lower bounds for read-k-times branching programs - Borodin, Razborov, et al. - 1993
48	Two Applications of Inductive Counting for Complementation Problems - Borodin, Dymond, et al. - 1989
46	A theorem on probabilistic constant depth computations - Ajtai, Ben-Or - 1984
46	A complexity theory based on Boolean algebra - Skyum, Valiant
46	Properties that characterize LOGCFL - Venkateswaran - 1991
41	Probabilistic checking of proofs - Arora, Safra - 1992
39	Lower bounds for monotone span programs - Beimel, Gál, et al. - 1997
36	Structure and importance of logspace-MOD-classes - Buntrock, Hertrampf, et al. - 1991
33	A lower bound for integer multiplication with read-once branching programs - Ponzio - 1995
32	Upper and Lower Bounds for First Order Expressibility - Immerman - 1982
31	Computing with unreliable information - Feige, Peleg, et al. - 1990
31	Lower bounds for the complexity of reliable boolean circuits with noisy gates - Gács, Gál - 1994
31	On the method of approximations - Razborov - 1989
28	On time-hardware complexity tradeoffs for Boolean functions - Spira - 1971
27	Schmeltz: Reliable Computation with Noisy Circuits and Decision Trees - A General n log n Lower Bound, in these proceedings - Reischuk, B
25	A boolean function requiring 3n network size - Blum - 1984
22	Complexity in electronic switching circuits - Muller - 1956
21	Fault tolerant sorting networks - Assaf, Upfal - 1991
19	Two lower bounds for branching programs - Ajtai, Babai, et al. - 1986
18	A new lower bound theorem for read-only-once branching programs and its applications - Simon, Szegedy - 1993
18	Separating the Polynomial Hierarchy by oracles - Yao - 1985
17	A method of circuit synthesis - Lupanov - 1959
16	Transparent proofs and limits to approximations - Babai - 1994