scientific article

zbMath0819.94031MaRDI QIDQ3364203

Elizaveta Antonovna Okol'Nishnikova

Publication date: 1991

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

binary linear codebinary programsrealization of Boolean functionsnonlinear lower estimates

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Boolean functions (06E30)

Related Items (11)

On the hierarchy of nondeterministic branching k-programs ⋮ Expanders and time-restricted branching programs ⋮ Neither reading few bits twice nor reading illegally helps much ⋮ A lower bound on branching programs reading some bits twice ⋮ On uncertainty versus size in branching programs. ⋮ A note on read-$k$ times branching programs ⋮ Limitations of incremental dynamic programming ⋮ New lower bounds and hierarchy results for restricted branching programs ⋮ A nondeterministic space-time tradeoff for linear codes ⋮ A read-once lower bound and a \((1,+k)\)-hierarchy for branching programs ⋮ Linear codes are hard for oblivious read-once parity branching programs

This page was built for publication: