Theoretical computer science
- Wikidata
- https://www.wikidata.org/wiki/Q2878974
- OpenAlex ID
- https://openalex.org/C80444323 (API record)
- OpenAlex Description
- subfield of computer science and mathematics
- OpenAlex Level [?]
- 1
Broader Concepts
Narrower Concepts
- Abstract data type
- Abstract interpretation
- Abstract machine
- Algorithmic complexity
- Automated reasoning
- Automated theorem proving
- Automaton
- Binary decision diagram
- Bisimulation
- Boolean data type
- Boolean satisfiability problem
- Call graph
- Certificate
- Coding theory
- Communication complexity
- Computability
- Concept class
- Conjunctive normal form
- Control flow graph
- Datalog
- Decidability
- Deductive database
- Description logic
- Expressive power
- Formal verification
- Functional programming
- Generic programming
- Graph
- Leader election
- Linear logic
- Linear temporal logic
- Liveness
- Logic programming
- Membrane computing
- Model checking
- Mutual exclusion
- Natural computing
- Network structure
- Non-monotonic logic
- Nondeterministic algorithm
- Observational equivalence
- PageRank
- Partial evaluation
- Pi calculus
- Process calculus
- Program synthesis
- Program transformation
- Prolog
- Reachability
- Refinement calculus
- Running time
- Satisfiability
- Satisfiability modulo theories
- Separation logic
- Source model
- Succinctness
- Symbolic data analysis
- Temporal logic
- Transition system
- True quantified Boolean formula
Associated Authors
- Atılım Güneş Baydin
- Bistra Dilkina
- Daniel Sanz-Alonso
- Edward B Lochocki
- Gherardo Varando
- Jeaneth Machicao
- Meichen Liu
- Suoyi Tan
Add Incoming Edge
Login via ORCiD to contribute.
Add Outgoing Edge
Login via ORCiD to contribute.