Research Project
Grant-in-Aid for Research Activity Start-up
In this research project, we obtained the following results.(1) We analyzed the applicability of linear program to the constraint satisfaction problem and proposed an algorithm to find a satisfiability preserving assignment. (2) We applied the result (1) to Horn CNFs and obtained a linear time algorithm to find a linear autark assignment. (3) We revealed the computational complexity of optimal matroid partitioning problems under various objective functions. (4) We revealed the computational complexity of three discrete puzzles.
All 2018 2017 2016
All Journal Article (3 results) (of which Peer Reviewed: 3 results, Open Access: 1 results) Presentation (3 results) (of which Int'l Joint Research: 3 results)
Japan Journal of Industrial and Applied Mathematics
Volume: 35 Issue: 1 Pages: 297-309
10.1007/s13160-017-0284-6
210000163987
Journal of Artificial Intelligence Research
Volume: 61 Pages: 291-321
Discrete Applied Mathematics
Volume: VOL.200 Pages: 67-78
10.1016/j.dam.2015.07.004