Help on query formulation
first | previous | 1 | next | last

Result 1 to 15 of 15 total

The history of algorithmic complexity. (English)
Math. Enthus. 13, No. 3, 217-242 (2016).
Classification: P20 A30
1
Logical foundations of mathematics and computational complexity. A gentle introduction. (English)
Springer Monographs in Mathematics. Cham: Springer (ISBN 978-3-319-00118-0/hbk; 978-3-319-00119-7/ebook). xiv, 695~p. (2013).
Classification: E35 E65 P25 Reviewer: Branislav Boričić (Beograd)
2
From the ski run to abstract probability spaces. (Von der Schipiste in den abstrakten Wahrscheinlichkeitsraum.) (German)
Spektrum Wiss. 2012, No. 11, 82-85 (2012).
Classification: A30 K50 K60 I90
3
Limits of computability: Discovery and exploratory learning in practice. (Grenzen der Berechenbarkeit: Entdeckendes und forschendes Lernen in der Praxis.) (German)
Log In 31, No. 168, 42-49 (2011).
Classification: P24 Q84
4
Teacher expertise explored as mathematics for teaching. (English)
Li, Yeping (ed.) et al., Expertise in mathematics instruction. An international perspective. New York, NY: Springer (ISBN 978-1-4419-7706-9/hbk; 978-1-4419-7707-6/ebook). 151-164 (2011).
Classification: B50 D20
5
Comparing theoretical perspectives in describing mathematics departments: complexity and activity. (English)
Educ. Stud. Math. 75, No. 2, 153-170 (2010).
Classification: D20 B20
6
Informatics Olympiads: Approaching mathematics through code. (English)
Math. Compet. 20, No. 2, 29-51 (2007).
Classification: Q90 B60 U40 N70
7
Cognitive variables in problem solving: A nonlinear approach. (English)
Int. J. Sci. Math. Educ. 3, No. 1, 7-32 (2005).
Classification: C30 D50
8
Three classical problems and complexity. (Tres problemas clásicos y complejidad.) (Spanish)
SUMA (Granada), No. 47, 29-36 (2004).
Classification: N70 P20
9
Formalizing knowledge - an appropriate tool for solving comlex requirements. (Formalisierung von Wissen - ein probates Werkzeug zur Bewältigung komplexer Anforderungen.) (German)
Math. Didact. 26, No. 2, 73-90 (2003).
Classification: C30 D50
10
Number theory for computing. (English)
Springer, Berlin (ISBN 3-540-43072-5). 457 p. (2002).
Classification: F65 N15
11
How NP got a new definition: A survey of probabilistically checkable proofs. (English)
Li Tatsien, Proceedings of the International Congress of Mathematicians. Vol. III. Higher Education Press, Beijing (ISBN 7-04-008690-5). 637-647 (2002).
Classification: P20
12
Chaitin’s equation: A spectacular extension of Goedels’s theorem. Une extension spectaculaire du theoreme de Goedel: l’equation de Chaitin. Die Chaitinsche Gleichung: Eine spektakulaere Erweiterung des Goedelschen Satzes. (French)
Recherche (Paris). (Jun 1988) v. 19(200) p. 860-862. CODEN: RCCHBV [ISSN 0029-5671]
Classification: P20 N10
13
Complexity issues in algebraic algorithms: relevant topics for mathematical education. Komplexitaetsfragen bei algebraischen Algorithmen: Relevante Themen fuer die Mathematikausbildung. (English)
SIGSAM Bull. (Nov 1984); (Feb 1985) v. 18(4); v. 19(1) p. 26-30. Conference: 5. International Congress on Mathematical Education (ICME-5), Adelaide (Australia), 24-30 Aug 1984 CODEN: SIGSBZ
Classification: H24 H25 N24 N25
14
Computability, complexity, logic. An introduction to algorithm, languages and calculi with particular consideration of their complexity. Berechenbarkeit, Komplexitaet, Logik. Eine Einfuehrung in Algorithmen, Sprachen und Kalkuele unter besonderer Beruecksichtigung ihrer Komplexitaet. (German)
Braunschweig: Vieweg. 1985. 476 p. [ISBN 3-528-08928-8]
Classification: E35 E45 P25
15
first | previous | 1 | next | last

Result 1 to 15 of 15 total

Valid XHTML 1.0 Transitional Valid CSS!