On the hierarchy of nondeterministic branching k-programs

DOI10.1007/BFb0036199OpenAlexW1575676006MaRDI QIDQ5055950

Elizaveta Antonovna Okol'Nishnikova

Publication date: 9 December 2022

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0036199

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Related Items (1)

On the hierarchies for deterministic, nondeterministic and probabilistic ordered read-\(k\)-times branching programs

Cites Work

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

This page was built for publication: On the hierarchy of nondeterministic branching k-programs