Computational Complexity Conference
GPTKB entity
Statements (52)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:conference
|
| gptkbp:abbreviation |
gptkb:CCC
|
| gptkbp:allows |
competitive
|
| gptkbp:established |
1986
|
| gptkbp:field |
theoretical computer science
|
| gptkbp:focusesOn |
circuit complexity
communication complexity derandomization parameterized complexity proof complexity quantum complexity resource-bounded computation randomness in computation complexity of algorithms complexity classes lower bounds algebraic complexity complexity in algebra complexity in approximation algorithms complexity in automata theory complexity in average-case analysis complexity in coding theory complexity in combinatorics complexity in cryptography complexity in data structures complexity in distributed computing complexity in fine-grained complexity complexity in games complexity in geometry complexity in interactive proofs complexity in learning theory complexity in logic complexity in non-uniform computation complexity in optimization complexity in parallel computing complexity in proof systems complexity in property testing complexity in pseudorandomness complexity in randomness extraction complexity in space-bounded computation complexity in streaming algorithms complexity in sublinear algorithms complexity in time-bounded computation complexity in worst-case analysis hardness amplification |
| gptkbp:formerName |
gptkb:Structure_in_Complexity_Theory_Conference
|
| gptkbp:frequency |
annual
|
| https://www.w3.org/2000/01/rdf-schema#label |
Computational Complexity Conference
|
| gptkbp:organizedBy |
gptkb:Computational_Complexity_Foundation
|
| gptkbp:publishesProceedingsIn |
gptkb:Leibniz_International_Proceedings_in_Informatics
|
| gptkbp:bfsParent |
gptkb:Complexity_theory
|
| gptkbp:bfsLayer |
6
|