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
521997
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
482006
Passages of proof
CS Calude, E Calude, S Marcus
arXiv preprint math/0305213, 2003
412003
Guest column: Adiabatic quantum computing challenges
CS Calude, E Calude, MJ Dinneen
ACM SIGACT News 46 (1), 40-61, 2015
372015
The road to quantum computational supremacy
CS Calude, E Calude
Jonathan M. Borwein Commemorative Conference, 349-367, 2017
292017
Finite nondeterministic automata: Simulation and minimality
CS Calude, E Calude, B Khoussainov
Theoretical Computer Science 242 (1-2), 219-235, 2000
292000
Deterministic automata simulation, universality and minimality
C Calude, E Calude, B Khoussainov
Annals of Pure and Applied Logic 90 (1-3), 263-276, 1997
271997
Evaluating the complexity of mathematical problems: Part 2
CS Calude, E Calude
Complex Systems 18 (4), 387, 2010
26*2010
Bivariate operators of Schurer-Stancu type
D Barbosu
An. St. Univ. Ovidius Constanta 11 (1), 1-8, 2003
212003
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
192010
The complexity of the four colour theorem
CS Calude, E Calude
LMS Journal of Computation and Mathematics 13, 414-425, 2010
192010
Deterministic incomplete automata: Simulation, universality and complementarity
E Calude, M Lipponen
Unconventional Models of Computation, Springer-Verlag, Singapore, 131-149, 1998
191998
Inductive complexity measures for mathematical problems
M Burgin, CS Calude, E Calude
International Journal of Foundations of Computer Science 24 (04), 487-500, 2013
152013
Minimal Deterministic Incomplete Automata.
E Calude, M Lipponen
J. Univers. Comput. Sci. 3 (11), 1180-1193, 1997
151997
The Complexity of Riemann's Hypothesis.
E Calude
Journal of Multiple-Valued Logic & Soft Computing 18, 2012
142012
The complexity of Euler’s integer partition theorem
CS Calude, E Calude, MS Queen
Theoretical Computer Science 454, 72-80, 2012
132012
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
112013
Developments in Language Theory
CS Calude, E Calude, MJ Dinneen
Springer-Verlag Berlin/Heidelberg, 2005
11*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
112003
Inductive complexity of P versus NP Problem
CS Calude, E Calude, MS Queen
International Conference on Unconventional Computing and Natural Computation …, 2012
102012
The system can't perform the operation now. Try again later.
Articles 1–20