IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Online ISSN : 1745-1337
Print ISSN : 0916-8508
Special Section on Discrete Mathematics and Its Applications
An Exact Algorithm for Oblivious Read-Twice Branching Program Satisfiability
Kazuhisa SETO, Junichi TERUYAMA
Author information
Keywords: oblivious branching program, read twice, satisfiability, exact algorithm
JOURNAL RESTRICTED ACCESS

2016 Volume E99.A Issue 6 Pages 1019-1024

Details
Download PDF (713K)
Download citation RIS

(compatible with EndNote, Reference Manager, ProCite, RefWorks)

BIB TEX

(compatible with BibDesk, LaTeX)

Text
How to download citation
Contact us
Abstract
We propose an exact algorithm to determine the satisfiability of oblivious read-twice branching programs. Our algorithm runs in $2^{\left(1 - \Omega(\frac{1}{\log c})\right)n}$ time for instances with n variables and cn nodes.
Content from these authors
© 2016 The Institute of Electronics, Information and Communication Engineers
Previous article Next article
Favorites & Alerts

Recently viewed articles
Announcements from publisher
Share this page
feedback
 Top