pdf-format: |
|
@InProceedings{nagao_et_al:LIPIcs:2017:8242, author = {Atsuki Nagao and Kazuhisa Seto and Junichi Teruyama}, title = {{Satisfiability Algorithm for Syntactic Read-$k$-times Branching Programs}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {58:1--58:10}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2017/8242}, URN = {urn:nbn:de:0030-drops-82423}, doi = {10.4230/LIPIcs.ISAAC.2017.58}, annote = {Keywords: branching program, read-k-times, satisfiability, moderately exponential time, polynomial space} }
Keywords: | branching program, read-k-times, satisfiability, moderately exponential time, polynomial space | |
Seminar: | 28th International Symposium on Algorithms and Computation (ISAAC 2017) | |
Issue date: | 2017 | |
Date of publication: | 07.12.2017 |