No. | Title | Author | Year |
---|---|---|---|
1 | Optimal LZ-End Parsing Is Hard | Bannai, Hideo et al. | 2023 |
2 | Satisfiability Algorithm for Syntactic Read-$k$-times Branching Programs | Nagao, Atsuki et al. | 2017 |
3 | Bounded Depth Circuits with Weighted Symmetric Gates: Satisfiability, Lower Bounds and Compression | Sakai, Takayuki et al. | 2016 |
4 | Improved Exact Algorithms for Mildly Sparse Instances of Max SAT | Sakai, Takayuki et al. | 2015 |
Current Page : | |
Number of result pages: | 1 |
Number of documents: | 4 |