Result 1 to 20 of 35 total
Inductive complexity of P versus NP problem. Extended abstract. (English)
Durand-Lose, Jérôme (ed.) et al., Unconventional computation and natural computation. 11th international conference, UCNC 2012, Orléan, France, September 3‒7, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32893-0/pbk). Lecture Notes in Computer Science 7445, 2-9 (2012).
1
The complexity of Euler’s integer partition theorem. (English)
Theor. Comput. Sci. 454, 72-80 (2012).
2
The complexity of Riemann’s hypothesis. (English)
J. Mult.-Val. Log. Soft Comput. 18, No. 3-4, 257-265 (2012).
3
The complexity of the four colour theorem. (English)
LMS J. Comput. Math. 13, 414-425, electronic only (2010).
4
Evaluating the complexity of mathematical problems. II. (English)
Complex Syst. 18, No. 4, 387-401 (2010).
5
Pi\_1-statements, chaotic systems and the church-Turing thesis. (English)
Comput. Res. Repos. 2010, Article No. 1006.2951 (2010).
6
Evaluating the complexity of mathematical problems. I. (English)
Complex Syst. 18, No. 3, 267-285 (2009).
7
Proving and programming. (English)
Calude, Cristian S. (ed.), Randomness and complexity. From Leibniz to Chaitin. Dedicated to Gregory J. Chaitin on the occasion of his 60th birthday. Hackensack, NJ: World Scientific (ISBN 978-981-277-082-0/hbk). 301-319 (2007).
8
A new measure of the difficulty of problems. (English)
J. Mult.-Val. Log. Soft Comput. 12, No. 3-4, 285-307 (2006).
9
Passages of proof. (English)
Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 84, 167-188 (2004).
10
Developments in language theory. 8th international conference, DLT 2004, Auckland, New Zealand, December 13‒17, 2004. Proceedings. (English)
Lecture Notes in Computer Science 3340. Berlin: Springer (ISBN 3-540-24014-4/pbk). xi, 431~p. EUR~56.00/net; sFr~99.00; \sterling~43.00; \$~78.00 (2004).
11
A uniform approach to test computational complementarity. (English)
Acta Cybern. 16, No. 3, 367-384 (2004).
12
Passages of proof (English)
Bulletin of the EATCS 84, 167-188 (2004).
13
What is the value of $Taxicab(6)$? (English)
J. UCS 9, No. 10, 1196-1203, electronic only (2003).
14
Automata: From uncertainty to quantum. (English)
Kuich, Werner (ed.) et al., Developments in language theory. 5th international conference, DLT 2001, Wien, Austria, July 16‒21, 2001. Revised papers. Berlin: Springer (ISBN 3-540-43453-4). Lect. Notes Comput. Sci. 2295, 1-14 (2002).
15
The bridge crossing problem. (English)
Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 77, 180-190 (2002).
16
The bridge crossing problem (English)
Bulletin of the EATCS 77, 180-190 (2002).
17
Computational complementarity for probabilistic automata. (English)
Martín-Vide, Carlos (ed.) et al., Where mathematics, computer science, linguistics and biology meet. Essays in honour of Gheorghe Păun. Dordrecht: Kluwer Academic Publishers (ISBN 0-7923-6693-X). 99-113 (2001).
18
Testing computational complementarity for Mermin automata. (English)
Mult.-Valued Log. 6, No. 1-2, 47-65 (2001).
19
Automata: from uncertainty to quantum (English)
Developments in Language Theory, 1-14 (2001).
20
Result 1 to 20 of 35 total
Start
Contact
Print
General Help
