Evaluating the Complexity of Mathematical Problems. Part 1 (2009)

Cached

Download Links

by C. S. Calude , Elena Calude
Citations:1 - 0 self

Documents Related by Co-Citation

2 The Complexity of the Four Colour Theorem – Cristian S. Calude, Elena Calude - 2009
2 On the Difficulty of Goldbach and – J Hertel - 2009
2 The Complexity of Proving Chaoticity and the Church-Turing Thesis – Cristian S. Calude, Elena Calude, Karl Svozil - 2010
2 E.: Evaluating the Complexity of Mathematical Problems – C S Calude, Calude - 2010
2 The complexity of Goldbach’s Conjecture and Riemann’s – E Calude - 2009
1 The complexity of Riemann’s Hypothesis – E Calude - 2010
1 Fermat’s Last Theorem and chaoticity. Natural Computing (accepted – E Calude - 2011
1 M.C.: Introduction to Algorithms, Data Structures and Formal Languages, 2nd edn – M J Dinneen, G Gimel’farb, Wilson
1 The Art of Computer Programming, 1st edn – D E Knuth - 2011
8 Exact Approximations of Omega Numbers – C. S. Calude, M. J. Dinneen, Cristian S. Calude, Michael J. Dinneen
10 Solving finitely refutable mathematical problems – C S Calude, H Jürgensen, S Legg - 2000
20 Computing a glimpse of randomness – Cristian S. Calude, Michael J. Dinneen, Chi-kou Shu
10 A New Measure of the Difficulty of Problems – Cristian S. Calude, Elena Calude, Michael J. Dinneen - 2006
57 Information and randomness: an algorithmic perspective. 2nd edition – C S Calude - 2002
320 Algorithmic information theory – G. J. Chaitin - 1977