Comparing the sizes of nondeterministic branching read-k-times programs

DOI10.1016/S0166-218X(02)00305-0zbMath0933.68064MaRDI QIDQ4268146

Elizaveta Antonovna Okol'Nishnikova

Publication date: 28 October 1999

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

complexityBoolean functionbranching program

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Applications of graph theory to circuits and networks (94C15)

Cites Work

• On lower bounds for read-\(k\)-times branching programs
• A note on read-$k$ times branching programs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item