Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama. Satisfiability Algorithm for Syntactic Read-$k$-times Branching Programs. In Yoshio Okamoto, Takeshi Tokuyama, editors, 28th International Symposium on Algorithms and Computation, ISAAC 2017, December 9-12, 2017, Phuket, Thailand. Volume 92 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. [doi]
@inproceedings{NagaoST17,
title = {Satisfiability Algorithm for Syntactic Read-$k$-times Branching Programs},
author = {Atsuki Nagao and Kazuhisa Seto and Junichi Teruyama},
year = {2017},
doi = {10.4230/LIPIcs.ISAAC.2017.58},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.58},
researchr = {https://researchr.org/publication/NagaoST17},
cites = {0},
citedby = {0},
booktitle = {28th International Symposium on Algorithms and Computation, ISAAC 2017, December 9-12, 2017, Phuket, Thailand},
editor = {Yoshio Okamoto and Takeshi Tokuyama},
volume = {92},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
isbn = {978-3-95977-054-5},
}