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

Result 1 to 4 of 4 total

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
1
Introduction into $NP$-hard problems. (Einführung in $NP$-schwere Probleme.) (German)
Wurzel 45, No. 2, 26-31 (2011).
Classification: P20 K30
2
The vertex cover problem: A case study on the didactics of $NP$-hard problems. Pt. 2. (Das Knotenüberdeckungsproblem: Eine Fallstudie zur Didaktik $NP$-schwerer Probleme. T. 2.) (German)
Log In 27, No. 148-149, 81-89 (2007).
Classification: P20 K30 N70
3
The vertex cover problem: A case study on the didactics of NP-hard problems. Pt. 1. (Das Knotenüberdeckungsproblem: Eine Fallstudie zur Didaktik NP-schwerer Probleme. T. 1.) (German)
Log In 27, No. 146-147, 53-59 (2007).
Classification: P20 K30 N70
4
first | previous | 1 | next | last

Result 1 to 4 of 4 total

Valid XHTML 1.0 Transitional Valid CSS!