On Tseitin Formulas, Read-Once Branching Programs and Treewidth
Sign Up to like & getrecommendations! Published in 2021 at "Theory of Computing Systems"
DOI: 10.1007/s00224-020-10007-8
Abstract: We show that any nondeterministic read-once branching program that decides a satisfiable Tseitin formula based on an n × n grid graph has size at least 2 Ω( n ) . Then using the Excluded… read more here.
Keywords: read branching; tseitin formula; size; formula based ... See more keywords