Satisfiability Algorithm for Syntactic Read-k-times Branching Programs.
Atsuki NagaoKazuhisa SetoJunichi TeruyamaPublished in: Theory Comput. Syst. (2020)
Keyphrases
- learning algorithm
- times faster
- detection algorithm
- experimental evaluation
- optimization algorithm
- np hard
- randomly generated
- recognition algorithm
- high accuracy
- cost function
- preprocessing
- computational complexity
- computational cost
- worst case
- significant improvement
- linear programming
- expectation maximization
- k means
- matching algorithm
- noisy data
- optimal solution
- machine learning