Elena Calude

Michael J. Dinneen

SIGACT News, 2015

2013

Inductive Complexity of the P versus NP Problem.

[BibT_eX]

[DOI]

Melissa S. Queen

Parallel Process. Lett., 2013

Algorithmic Complexity of Mathematical Problems: An Overview of Results and Open Problems.

[BibT_eX]

[DOI]

Int. J. Unconv. Comput., 2013

Inductive Complexity Measures for Mathematical Problems.

[BibT_eX]

[DOI]

Mark Burgin

Int. J. Found. Comput. Sci., 2013

2012

The complexity of Euler's integer partition theorem.

[BibT_eX]

[DOI]

Melissa S. Queen

Theor. Comput. Sci., 2012

Fermat's last theorem and chaoticity.

[BibT_eX]

[DOI]

Nat. Comput., 2012

The Complexity of Riemann's Hypothesis.

[BibT_eX]

[DOI]

J. Multiple Valued Log. Soft Comput., 2012

Inductive Complexity of P versus NP Problem - Extended Abstract.

[BibT_eX]

[DOI]

Melissa S. Queen

Proceedings of the Unconventional Computation and Natural Computation, 2012

2010

The complexity of the four colour theorem.

[BibT_eX]

[DOI]

LMS J. Comput. Math., 2010

Pi_1-Statements, Chaotic Systems and the Church-Turing Thesis

[BibT_eX]

[DOI]

Karl Svozil

CoRR, 2010

Evaluating the Complexity of Mathematical Problems: Part 2.

[BibT_eX]

[DOI]

Complex Syst., 2010

2009

Evaluating the Complexity of Mathematical Problems: Part 1.

[BibT_eX]

[DOI]

Complex Syst., 2009

2006

A New Measure of the Difficulty of Problems.

[BibT_eX]

[DOI]

Michael J. Dinneen

J. Multiple Valued Log. Soft Comput., 2006

2004

Passages of Proof.

[BibT_eX]

Solomon Marcus

Bull. EATCS, 2004

A Uniform Approach to Test Computational Complementarity.

[BibT_eX]

[DOI]

Bruce Mills

Lan Mills

Acta Cybern., 2004

2003

What is the Value of Taxicab(6)?

[BibT_eX]

[DOI]

Michael J. Dinneen

J. Univers. Comput. Sci., 2003

2002

The Bridge Crossing Problem.

[BibT_eX]

Bull. EATCS, 2002

2001

Automata: From Uncertainty to Quantum.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 5th International Conference, 2001

Computational complementarity for probabilistic automata.

[BibT_eX]

Karl Svozil

Proceedings of the Where Mathematics, 2001

Liars, Demons, and Chaos.

[BibT_eX]

Peter Kay

Proceedings of the Words, Semigroups, and Transductions, 2001

2000

Finite nondeterministic automata: Simulation and minimality.

[BibT_eX]

[DOI]

Bakhadyr Khoussainov

Theor. Comput. Sci., 2000

Quantum Correlations Conundrum: An Automata-Theoretic Approach.

[BibT_eX]

Karl Svozil

Proceedings of the Recent Topics in Mathematical and Computational Linguistics, 2000

1999

Bisimulations and behaviour of nondeterministic automata.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 1999

1998

Computational Complementarity for Mealy Automata.

[BibT_eX]

Catalina Stefanescu

Bull. EATCS, 1998

1997

Minimal Deterministic Incomplete Automata.

[BibT_eX]

[DOI]

Marjo Lipponen

J. Univers. Comput. Sci., 1997

Deterministic Automata: Simulation, Universality and Minimality.

[BibT_eX]

[DOI]

Bakhadyr Khoussainov

Ann. Pure Appl. Log., 1997

Deterministic Automata: Simulation, Universality and Minimality. Extended Abstract.

[BibT_eX]