Statements (60)
| Predicate | Object |
|---|---|
| gptkbp:instance_of |
gptkb:Mathematics
|
| gptkbp:author |
gptkb:Ronald_L._Graham
gptkb:Donald_Knuth |
| gptkbp:contains |
number theory
graph theory combinatorial mathematics asymptotic analysis |
| gptkbp:first_edition |
Second Edition
|
| gptkbp:focuses_on |
discrete mathematics
|
| https://www.w3.org/2000/01/rdf-schema#label |
Concrete Mathematics
|
| gptkbp:illustrated_by |
yes
|
| gptkbp:is_a_solution_for |
yes
|
| gptkbp:is_associated_with |
gptkb:Knuth's_up-arrow_notation
gptkb:Recursion Dynamic programming Mathematical logic Set theory Statistics Graph theory Probability theory Mathematical induction Big O notation Mathematical proofs Algorithm analysis Combinatorial designs Graph algorithms Complexity theory Randomized algorithms Mathematical reasoning Combinatorial algorithms Discrete structures Number-theoretic algorithms |
| gptkbp:is_available_in |
digital format
print format |
| gptkbp:is_cited_in |
gptkb:The_Art_of_Computer_Programming
gptkb:Concrete_Mathematics:_A_Foundation_for_Computer_Science |
| gptkbp:is_considered_as |
a classic in mathematics education
|
| gptkbp:is_influential_in |
computer science education
|
| gptkbp:is_known_for |
mixing continuous and discrete mathematics
|
| gptkbp:is_part_of |
gptkb:computer_science
Knuth's series |
| gptkbp:is_recommended_for |
graduate students
advanced undergraduate students |
| gptkbp:is_related_to |
Discrete Mathematics
Mathematical Induction Generating Functions Recurrence Relations Combinatorial Structures |
| gptkbp:is_taught_in |
university courses
|
| gptkbp:is_used_for |
problem solving
theoretical computer science mathematical proofs |
| gptkbp:is_used_in |
algorithm analysis
computer programming mathematical logic |
| gptkbp:published_in |
gptkb:1989
|
| gptkbp:publisher |
gptkb:Addison-Wesley
|
| gptkbp:training |
yes
|
| gptkbp:bfsParent |
gptkb:Donald_Knuth
|
| gptkbp:bfsLayer |
3
|