"Satisfiable Tseitin Formulas Are Hard for Nondeterministic Read-Once ..."

Ludmila Glinskih, Dmitry Itsykson (2017)

Details and statistics

DOI: 10.4230/LIPICS.MFCS.2017.26

access: open

type: Conference or Workshop Paper

metadata version: 2018-08-23

a service of  Schloss Dagstuhl - Leibniz Center for Informatics