Statements (75)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:academic
|
| https://www.w3.org/2000/01/rdf-schema#label |
Algorithms and Complexity
|
| gptkbp:includes |
gptkb:Kolmogorov_complexity
gptkb:geometry gptkb:smoothed_analysis gptkb:NP-completeness gptkb:P_vs_NP_problem algorithm analysis circuit complexity computability theory recursion theory optimization problems Turing machines decision problems polynomial time reduction algorithmic randomness combinatorial algorithms communication complexity data structures derandomization graph algorithms parameterized complexity proof complexity randomized algorithms resource-bounded computation algorithmic efficiency algorithmic game theory distributed algorithms interactive proofs quantum algorithms approximation algorithms descriptive complexity cryptographic algorithms cache-oblivious algorithms parallel algorithms complexity classes sorting algorithms exponential time space complexity computational learning theory streaming algorithms hardness of approximation lower bounds property testing sublinear algorithms algorithm engineering probabilistic analysis string algorithms external memory algorithms online algorithms number-theoretic algorithms search problems time complexity adversarial analysis algebraic algorithms algorithmic lower bounds algorithmic upper bounds amortized analysis average-case complexity best-case complexity computational intractability computational models fixed-parameter tractability hardness of problems oracle machines randomized complexity classes upper bounds worst-case complexity |
| gptkbp:relatedTo |
computer science
theoretical computer science |
| gptkbp:studies |
algorithms
computational complexity |
| gptkbp:bfsParent |
gptkb:Max_Planck_Institute_for_Informatics
|
| gptkbp:bfsLayer |
3
|