ASIAN '02 Proceedings of the7th Asian Computing Science Conference on Advances in Computing Science: Internet Computing and Modeling, Grid Computing, Peer-to-Peer Computing, and Cluster
Transformation rules for CNOT-based quantum circuits and their applications
New Generation Computing - Quantum computing
Annals of Mathematics and Artificial Intelligence
Optimal length tree-like resolution refutations for 2SAT formulas
ACM Transactions on Computational Logic (TOCL)
Complexity results on DPLL and resolution
ACM Transactions on Computational Logic (TOCL)
On finding short resolution refutations and small unsatisfiable subsets
Theoretical Computer Science - Parameterized and exact computation
Density condensation of boolean formulas
Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
Note: The NP-hardness of finding a directed acyclic graph for regular resolution
Theoretical Computer Science
Note: Finding a tree structure in a resolution proof is NP-complete
Theoretical Computer Science
Hi-index | 0.01 |