pdf-format: |
|
@InProceedings{beyersdorff_et_al:LIPIcs:2018:8517, author = {Olaf Beyersdorff and Joshua Blinkhorn}, title = {{Genuine Lower Bounds for QBF Expansion}}, booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)}, pages = {12:1--12:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-062-0}, ISSN = {1868-8969}, year = {2018}, volume = {96}, editor = {Rolf Niedermeier and Brigitte Vall{\'e}e}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2018/8517}, URN = {urn:nbn:de:0030-drops-85174}, doi = {10.4230/LIPIcs.STACS.2018.12}, annote = {Keywords: QBF, proof complexity, lower-bound techniques, resolution} }
Keywords: | QBF, proof complexity, lower-bound techniques, resolution | |
Seminar: | 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018) | |
Issue date: | 2018 | |
Date of publication: | 27.02.2018 |