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, 1495-1523, 1997
511997
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
452006
Guest column: Adiabatic quantum computing challenges
CS Calude, E Calude, MJ Dinneen
ACM SIGACT News 46 (1), 40-61, 2015
372015
Passages of proof
CS Calude, E Calude, S Marcus
arXiv preprint math/0305213, 2003
362003
Finite nondeterministic automata: Simulation and minimality
CS Calude, E Calude, B Khoussainov
Theoretical Computer Science 242 (1-2), 219-235, 2000
282000
The road to quantum computational supremacy
CS Calude, E Calude
From Analysis to Visualization: A Celebration of the Life and Legacy of …, 2020
262020
Deterministic automata simulation, universality and minimality
C Calude, E Calude, B Khoussainov
Annals of Pure and Applied Logic 90 (1-3), 263-276, 1997
261997
Evaluating the complexity of mathematical problems. Part 1
CS Calude, E Calude
Department of Computer Science, The University of Auckland, New Zealand, 2008
24*2008
Deterministic incomplete automata: simulation, universality and complementarity
E Calude, M Lipponen
Unconventional Models of Computation, 131-149, 1998
191998
Bivariate operators of Schurer-Stancu type
D Barbosu
An. St. Univ. Ovidius Constanta 11 (1), 1-8, 2003
182003
Minimal deterministic incomplete automata
E Calude, M Lipponen
Department of Computer Science, The University of Auckland, New Zealand, 1997
161997
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), 2010
152010
The complexity of the four colour theorem
CS Calude, E Calude
LMS Journal of Computation and Mathematics 13, 414-425, 2010
152010
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
Inductive complexity of the P versus NP problem
CS Calude, E Calude, MS Queen
Parallel Processing Letters 23 (01), 1350007, 2013
112013
The Complexity of Riemann's Hypothesis.
E Calude
Journal of Multiple-Valued Logic & Soft Computing 18, 2012
112012
Developments in Language Theory
CS Calude, E Calude, MJ Dinneen
Springer-Verlag Berlin/Heidelberg, 2005
10*2005
What is the Value of Taxicab (6)?
CS Calude, E Calude, M Dinneen
Department of Computer Science, The University of Auckland, New Zealand, 2003
102003
The complexity of Euler’s integer partition theorem
CS Calude, E Calude, MS Queen
Theoretical Computer Science 454, 72-80, 2012
92012
Evaluating the complexity of mathematical problems
C Calude, E Calude
Centre for Discrete Mathematics and Theoretical Computer Science, 2008
92008
The system can't perform the operation now. Try again later.
Articles 1–20