Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Artificial Intelligence
Reference13 articles.
1. N. Creignou, The class of problems that are linearly equivalent to satisfiability or a uniform method for proving NP-completeness, Theor. Comp. Sci. 145(1995)111–145.
2. A.K. Dewdney Linear transformations between combinatorial problems, Int. J. Comp. Math. 11(1982)91–110.
3. M.R. Garey and G.S. Johnson,Computers and Intractability: A Guide for the Theory of NP-Completeness (Freeman, San Francisco, 1979).
4. E.M. Gold, Complexity of automaton identification from given data, Inf. Contr. 37(1978)302–320.
5. E. Grandjean, Non-trivial lower bound for an NP-complete problem on automata, SIAM J. Comput. 19(1990)438–451.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Sorting, linear time and the satisfiability problem;Annals of Mathematics and Artificial Intelligence;1996-12