Go to the corresponding LIPIcs Volume Portal 
Nagao, Atsuki ; Seto, Kazuhisa ; Teruyama, Junichi
pdfformat: 

@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:158:10}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770545}, ISSN = {18688969}, year = {2017}, volume = {92}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2017/8242}, URN = {urn:nbn:de:0030drops82423}, doi = {10.4230/LIPIcs.ISAAC.2017.58}, annote = {Keywords: branching program, readktimes, satisfiability, moderately exponential time, polynomial space} }
Keywords:  branching program, readktimes, satisfiability, moderately exponential time, polynomial space  
Seminar:  28th International Symposium on Algorithms and Computation (ISAAC 2017)  
Issue Date:  2017  
Date of publication:  04.12.2017 