Author:
Colbourn C. J.,Colbourn M. J.,Stinson D. R.
Publisher
Springer Berlin Heidelberg
Reference6 articles.
1. C. J. Colbourn, The complexity of completing partial Latin squares, Discrete Applied Mathematics, to appear.
2. S. A. Cook, The complexity of theorem-proving procedures, Proc. Third Annual ACM Symposium on the Theory of Computing, 1971, 151–158.
3. D. Curran and G. H. J. van Rees, Critical sets in Latin squares, Proc. Eighth Manitoba Conference on Numerical Mathematics and Computing, 1978, 165–168.
4. I. Holyer, The NP-completeness of some edge-partition problems, SIAM Journal on Computing 10 (1981) 713–717.
5. T. J. Schaefer, The complexity of satisfiability problems, Proc. Tenth ACM Symposium on the Theory of Computing, 1978, 216–226.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献