Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Revised and Extended;C.S. Calude,2002
2. Calude, C.S., Calude, E.: Evaluating the Complexity of Mathematical Problems. Part 1. Complex Systems 18, 267–285 (2009)
3. Calude, C.S., Calude, E.: Evaluating the Complexity of Mathematical Problems. Part 2. Complex Systems 18, 387–401 (2010)
4. Calude, C.S., Calude, E.: The Complexity of the Four Colour Theorem. LMS J. Comput. Math. 13, 414–425 (2010)
5. Calude, C.S., Calude, E., Dinneen, M.J.: A new measure of the difficulty of problems. Journal of Multiple-Valued Logic and Soft Computing 12, 285–307 (2006)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. INDUCTIVE COMPLEXITY MEASURES FOR MATHEMATICAL PROBLEMS;International Journal of Foundations of Computer Science;2013-06
2. INDUCTIVE COMPLEXITY OF THE P VERSUS NP PROBLEM;Parallel Processing Letters;2013-03
3. The complexity of Euler’s integer partition theorem;Theoretical Computer Science;2012-10
4. Inductive Complexity of Goodstein’s Theorem;Unconventional Computation and Natural Computation;2012
5. Inductive Complexity of P versus NP Problem;Unconventional Computation and Natural Computation;2012