pdf-format: |
|
@InProceedings{glinskih_et_al:LIPIcs:2017:8076, author = {Ludmila Glinskih and Dmitry Itsykson}, title = {{Satisfiable Tseitin Formulas Are Hard for Nondeterministic Read-Once Branching Programs}}, booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)}, pages = {26:1--26:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-046-0}, ISSN = {1868-8969}, year = {2017}, volume = {83}, editor = {Kim G. Larsen and Hans L. Bodlaender and Jean-Francois Raskin}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2017/8076}, URN = {urn:nbn:de:0030-drops-80767}, doi = {10.4230/LIPIcs.MFCS.2017.26}, annote = {Keywords: Tseitin formula, read-once branching program, expander} }
Keywords: | Tseitin formula, read-once branching program, expander | |
Seminar: | 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017) | |
Issue date: | 2017 | |
Date of publication: | 01.12.2017 |