Follow
Elena Calude
Title
Cited by
Cited by
Year
Physical versus computational complementarity. I
C Calude, E Calude, K Svozil, S Yu
International Journal of Theoretical Physics 36 (7), 1495-1523, 1997
531997
A new measure of the difficulty of problems
CS Calude, E Calude, M Dinneen
Department of Computer Science, The University of Auckland, New Zealand, 2006
412006
Passages of proof
CS Calude, E Calude, S Marcus
arXiv preprint math/0305213, 2003
352003
Finite nondeterministic automata: Simulation and minimality
CS Calude, E Calude, B Khoussainov
Theoretical Computer Science 242 (1-2), 219-235, 2000
302000
Deterministic automata simulation, universality and minimality
C Calude, E Calude, B Khoussainov
Annals of Pure and Applied Logic 90 (1-3), 263-276, 1997
301997
Guest column: Adiabatic quantum computing challenges
CS Calude, E Calude, MJ Dinneen
ACM SIGACT News 46 (1), 40-61, 2015
252015
Evaluating the Complexity of Mathematical Problems: Part 2
CS Calude, E Calude
Complex Systems 18 (4), 387, 2010
212010
The road to quantum computational supremacy
CS Calude, E Calude
Jonathan M. Borwein Commemorative Conference, 349-367, 2017
202017
Deterministic incomplete automata: simulation, universality and complementarity
E Calude, M Lipponen
Centre for Discrete Mathematics and Theoretical Computer Science, 1997
201997
Bivariate operators of Schurer-Stancu type
D Barbosu
An. St. Univ. Ovidius Constanta 11 (1), 1-8, 2003
192003
The complexity of proving chaoticity and the Church–Turing thesis
CS Calude, E Calude, K Svozil
Chaos: An Interdisciplinary Journal of Nonlinear Science 20 (3), 037103, 2010
162010
The complexity of the four colour theorem
CS Calude, E Calude
LMS Journal of Computation and Mathematics 13, 414-425, 2010
162010
Minimal Deterministic Incomplete Automata.
E Calude, M Lipponen
J. Univers. Comput. Sci. 3 (11), 1180-1193, 1997
161997
Inductive complexity measures for mathematical problems
M Burgin, CS Calude, E Calude
International Journal of Foundations of Computer Science 24 (04), 487-500, 2013
122013
The Complexity of Riemann's Hypothesis.
E Calude
Journal of Multiple-Valued Logic & Soft Computing 18, 2012
112012
The complexity of Euler’s integer partition theorem
CS Calude, E Calude, MS Queen
Theoretical Computer Science 454, 72-80, 2012
92012
Inductive complexity of P versus NP Problem
CS Calude, E Calude, MS Queen
International Conference on Unconventional Computing and Natural Computation …, 2012
92012
Evaluating the complexity of mathematical problems
C Calude, E Calude
Centre for Discrete Mathematics and Theoretical Computer Science, 2008
92008
Algorithmic Complexity of Mathematical Problems: An Overview of Results and Open Problems.
CS Calude, E Calude
Int. J. Unconv. Comput. 9 (3-4), 327-343, 2013
82013
Developments in Language Theory
CS Calude, E Calude, MJ Dinneen
Springer-Verlag Berlin/Heidelberg, 2005
82005
The system can't perform the operation now. Try again later.
Articles 1–20