|
gptkbp:instance_of
|
gptkb:book
|
|
gptkbp:author
|
gptkb:Donald_E._Knuth
gptkb:Ronald_L._Graham
|
|
gptkbp:contains
|
number theory
graph theory
asymptotic analysis
binomial coefficients
combinatorics
discrete mathematics
mathematical induction
recurrence relations
generating functions
|
|
gptkbp:first_edition
|
first edition
|
|
gptkbp:has_color
|
yes
|
|
gptkbp:has_contribution
|
yes
|
|
gptkbp:has_written
|
yes
|
|
gptkbp:influenced
|
theoretical computer science
mathematical logic
computer algorithms
|
|
gptkbp:is_a_solution_for
|
yes
|
|
gptkbp:is_available_in
|
digital format
print format
|
|
gptkbp:is_cited_in
|
research papers
|
|
gptkbp:is_considered_as
|
classic textbook
|
|
gptkbp:is_discussed_in
|
book reviews
academic reviews
educational forums
|
|
gptkbp:is_part_of
|
computer science literature
mathematics literature
Knuth's series
Computer Science curriculum
|
|
gptkbp:is_popular_among
|
gptkb:students
gptkb:Mathematician
computer scientists
|
|
gptkbp:is_recommended_for
|
undergraduate students
graduate students
advanced learners
|
|
gptkbp:is_referenced_in
|
gptkb:The_Art_of_Computer_Programming
|
|
gptkbp:is_used_for
|
gptkb:self-study
gptkb:educators
|
|
gptkbp:is_used_in
|
university courses
|
|
gptkbp:isbn
|
0-201-55802-8
|
|
gptkbp:language
|
English
|
|
gptkbp:page_count
|
672
|
|
gptkbp:published_year
|
gptkb:1989
|
|
gptkbp:publisher
|
gptkb:Addison-Wesley
|
|
gptkbp:subject
|
gptkb:computer_science
gptkb:Mathematics
|
|
gptkbp:training
|
yes
|
|
gptkbp:translated_into
|
multiple languages
|
|
gptkbp:bfsParent
|
gptkb:Concrete_Mathematics
|
|
gptkbp:bfsLayer
|
4
|