History


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

Result 1 to 6 of 6 total

The history of algorithmic complexity. (English)
Math. Enthus. 13, No. 3, 217-242 (2016).
Classification: P20 A30
1
Target set selection in social networks. (Zielgruppenauswahl in sozialen Netzwerken.) (German)
Wurzel 45, No. 3-4, 54-61 (2011).
Classification: P20 N70 K30
2
P, NP, and NP-completeness. The basics of computational complexity. (English)
Cambridge: Cambridge University Press (ISBN 978-0-521-12254-2/pbk; 978-0-521-19248-4/hbk; 978-0-511-90390-8/ebook). xxix, 184~p. (2010).
Classification: P25 Reviewer: Gregory Loren McColm (Tampa)
3
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
4
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
5
P = NP? (P = NP?) (German)
Elem. Math. 57, No. 3, 96-102 (2002).
Classification: P28
6
first | previous | 1 | next | last

Result 1 to 6 of 6 total

Valid XHTML 1.0 Transitional Valid CSS!