A. Borodin, A. Razborov, R. Smolensky  Home/Search
Context
Related
| genesis.mi.ras.ru/~razborov/nbp.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: genesis.mi.ras.ru/%7Erazborov/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A syntactic read-k-times branching program has the restriction that no variable occurs more than k times on any path (whether or not consistent) of the branching program. We rst extend the result in [30], to show that the \n=2 clique only function", which is easily seen to be computable by deterministic polynomial size read-twice programs, cannot be computed by nondeterministic polynomial size read-once programs, although its complement can be so computed. We then exhibit an explicit... (Update)
Active bibliography (related documents): More All
1.3: Lower Bounds for Deterministic and Nondeterministic Branching.. - Razborov (1991) (Correct)
0.9: Restricted Branching Programs and Hardware Verification - Ponzio (1995) (Correct)
0.6: A Lower Bound For Integer Multiplication With Read-Once Branching .. - Ponzio (1998) (Correct)
Similar documents based on text: More All
0.1: Resolution Lower Bounds for the Weak Functional Pigeonhole.. - Razborov (2002) (Correct)
0.1: Constructing Small Sets That Are Uniform in Arithmetic.. - Razborov, Szemerédi.. (1993) (Correct)
0.1: How Much Can Hardware Help Routing? - Borodin, Raghavan, Schieber (Correct)
BibTeX entry: (Update)
@misc{ borodin-lower,
author = "A. Borodin and A. Razborov and R. Smolensky",
title = "On Lower Bounds for Read-k-Times",
url = "citeseer.ist.psu.edu/688784.html" }
Citations (may not include all citations):202 The complexity of Boolean functions - Wegener - 1987
170 Nondeterministic space is closed under complementation - Immerman - 1988
132 Relationships between nondeterministic and deterministic tap.. (context) - Savitch - 1970
67 Freeman and Company (context) - Jacobson - 1985
62 Lower bounds for deterministic and nondeterministic branchin.. - Razborov - 1991
53 Generalized string matching (context) - Abrahamson - 1987
44 Communication Complexity (context) - Papadimitriou, Sipser - 1984
37 Multiparty protocols (context) - Chandra, Furst et al. - 1983
37 The computational complexity of universal hashing - Mansour, Nisan et al. - 1990
29 The method of forcing for nondeterministic automata (context) - Szelepcs - 1987
25 Multiparty protocols and logspace-hard pseudorandom sequence.. (context) - Babai, Nisan et al. - 1989
23 Meanders and their applications in lower bounds arguments (context) - Alon, Maass - 1988
14 An exponential lower bound for one-time-only branching progr.. (context) - ak - 1984
14 A fast algorithm for the string editing problem and decision.. (context) - Masek - 1976
13 Lower bounds to the complexity of symmetric boolean function.. (context) - Babai, Pudl et al. - 1990
12 Superlinear lower bounds for bounded-width branching program.. - Barrington, Straubing - 1991
9 A time-space tradeo for sorting on a general sequential mod.. (context) - Borodin, Cook - 1982
7 Lower bounds on the complexity of 1-time only branching prog.. (context) - Dunne - 1985
7 Lower bounds for branching programs computing characteristic.. (context) - Okolnishnikova - 1991
5 A general sequential time-space tradeo for nding unique ele.. (context) - Beame - 1991
4 Separating complexity classes related to certain input obliv.. (context) - Krause, Meinel et al. - 1989
4 Separating the eraser turing machine classes L e ; NL e ; co.. (context) - Krause, Meinel et al. - 1991
4 A lower bound for read-once branching programs (context) - Babai, Hajnal et al. - 1987
3 Lower bound techniques for read only once branching programs (context) - Simon, Szegedy - 1990
3 Time-space tradeo s for algebraic problems on general sequen.. (context) - Abrahamson - 1991
3 The theory of relay and switching circuits (context) - Gavrilov - 1950
3 A symbolic analysis of relay and switching networks (context) - Shannon - 1938
1 On bounded depth circuits with arbitrary gates (context) - Pudl
1 Representation of switching cirucits by binary-decision prog.. (context) - Lee - 1959
1 Time-space tradeo s for matrix multiplication and the discre.. (context) - Yesha - 1984
Documents on the same site (http://genesis.mi.ras.ru/%7Erazborov/): More
Read-Once Branching Programs, Rectangular Proofs of the.. - Razborov, Wigderson, Yao (1997) (Correct)
Lower Bounds for Deterministic and Nondeterministic Branching.. - Razborov (1991) (Correct)
Lower Bounds for Propositional Proofs and Independence Results.. - Razborov (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC