Download:
|
by S. Jukna, A. Razborov
Discrete Appl. Math
ftp://ftp.informatik.uni-trier.de/pub/users/Jukna/token.ps
Add To MetaCart
Abstract:
We first consider so-called (1; +s)-branching programs in which along every consistent path at most s variables are tested more than once. We prove that any such program computing a characteristic function of a linear code C has size at least 2
Citations
|
1287
|
The Theory of Error-Correcting Codes
– MacWilliams, Sloane
- 1978
|
|
304
|
The complexity of Boolean functions
– Wegener
- 1987
|
|
64
|
Lower bounds for deterministic and nondeterministic branching programs
– Razborov
- 1991
|
|
43
|
On the Complexity of Branching Programs and Decision Trees for Clique Functions
– Wegener
- 1988
|
|
26
|
On lower bounds for read-k times branching programs
– Borodin, Razborov, et al.
- 1993
|
|
23
|
An exponential lower bound for one-time-only branching programs
– Zak
- 1984
|
|
19
|
A Note on Read-k-times Branching Programs
– Jukna
- 1995
|
|
16
|
A fast algorithm for the string editing problem and decision graph complexity
– Masek
- 1976
|
|
15
|
New Lower Bounds and Hierarchy Results for Restricted Branching Programs
– Sieling
- 1994
|
|
12
|
Separating the eraser turing machine classes L e
– Krause, Meinel, et al.
- 1991
|
|
12
|
A Lower Bound on Branching Programs Reading Some Bits Twice
– Savick'y, Z'ak
- 1997
|
|
10
|
A superpolynomial lower bound for (1; +k(n))- branching programs
– Z'ak
- 1995
|
|
9
|
bounds on the complexity of one-time-only branching programs
– Dunne, Lower
- 1985
|
|
8
|
A lower bound for read-onceonly branching programs
– Babai, Hajnal, et al.
- 1987
|
|
6
|
Lower bounds on the complexity of real-time branching programs
– Kriegel, Waack
- 1988
|
|
4
|
bounds on the complexity of local circuits
– Jukna, Lower
- 1986
|
|
3
|
Exponential lower bounds on the complexity of local and real-time branching programs
– Krause
- 1988
|
|
3
|
Ninie ocenki slonosti realizacii harakteristiqeskih funkci$i dvoiqnyh kodov binarnymi programmami. Metody diskretnogo analiza, 51:61--83
– Okolnixnikova
- 1991
|
|
2
|
A lower bound for readonce -only branching programs
– Babai, Hajnal, et al.
- 1987
|
|
1
|
Ob odnou bulevskou funkcii
– Neqiporuk
- 1966
|
|
1
|
ak, A lower bound on branching programs reading some bits twice
– y, Z'
- 1995
|
|
1
|
ak, An exponential lower bound for one-time-only branching programs
– Z'
- 1984
|
|
1
|
ak A superpolynomial lower bound for (1; +k(n))-branching programs
– Z'
- 1995
|
|
1
|
A note on read-k-times branching programs, Informatique theorique et
– Jukna
- 1995
|
|
1
|
Ob odno$i bulevsko$i funkcii, DAN SSSR 169:4
– Neqiporuk
- 1966
|
