Login
|
New Account
AAAAAA
ITA
ENG
Results:
1-4
|
Results: 4
On P versus NP boolean AND co-NP for decision trees and read-once branching programs
Authors:
Jukna, S Razborov, A Savicky, P Wegener, I
Citation:
S. Jukna et al., On P versus NP boolean AND co-NP for decision trees and read-once branching programs, COMP COMPLE, 8(4), 1999, pp. 357-370
Combinatorics of monotone computations
Authors:
Jukna, S
Citation:
S. Jukna, Combinatorics of monotone computations, COMBINATORI, 19(1), 1999, pp. 65-85
Linear codes are hard for oblivious read-once parity branching programs
Authors:
Jukna, S
Citation:
S. Jukna, Linear codes are hard for oblivious read-once parity branching programs, INF PROCESS, 69(6), 1999, pp. 267-269
Some bounds on multiparty communication complexity of pointer jumping
Authors:
Damm, C Jukna, S Sgall, J
Citation:
C. Damm et al., Some bounds on multiparty communication complexity of pointer jumping, COMP COMPLE, 7(2), 1998, pp. 109-127
Risultati:
1-4
|