Lower Bounds for Nondeterministic Semantic Read-Once Branching Programs

Download PDF
Open Webpage

Stephen A. Cook, Jeff Edmonds, Venkatesh Medabalimi, Toniann Pitassi

Published: 2016, Last Modified: 15 May 2025ICALP 2016EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: We prove exponential lower bounds on the size of semantic read-once 3-ary nondeterministic branching programs. Prior to our result the best that was known was for D-ary branching programs with |D| >= 2^{13}.