Author:
Demaine Erik D.,Ma Fermi,Schvartzman Ariel,Waingarten Erik,Aaronson Scott
Subject
General Computer Science,Theoretical Computer Science
Reference14 articles.
1. The complexity of completing partial Latin squares;Colbourn;Discrete Appl. Math.,1984
2. Computational complexity and an integer programming model of Shakashaka;Demaine;IEICE Trans. Fundam. Electron. Commun. Comput. Sci.,2014
3. The NP-completeness of some edge-partition problems;Holyer;SIAM J. Comput.,1981
4. The complexity of planar counting problems;Hunt;SIAM J. Comput.,1998
5. Planar 1-in-3 satisfiability is NP-complete;Laroche;C. R. Acad. Sci. Ser. I, Math.,1993
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献