Go to the corresponding LIPIcs Volume Portal 
Glinskih, Ludmila ; Itsykson, Dmitry
pdfformat: 

@InProceedings{glinskih_et_al:LIPIcs:2017:8076, author = {Ludmila Glinskih and Dmitry Itsykson}, title = {{Satisfiable Tseitin Formulas Are Hard for Nondeterministic ReadOnce Branching Programs}}, booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)}, pages = {26:126:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770460}, ISSN = {18688969}, year = {2017}, volume = {83}, editor = {Kim G. Larsen and Hans L. Bodlaender and JeanFrancois Raskin}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2017/8076}, URN = {urn:nbn:de:0030drops80767}, doi = {10.4230/LIPIcs.MFCS.2017.26}, annote = {Keywords: Tseitin formula, readonce branching program, expander} }
Keywords:  Tseitin formula, readonce branching program, expander  
Seminar:  42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)  
Issue Date:  2017  
Date of publication:  22.11.2017 