File:TSP_Deutschland_3.png · Wikimedia Commons · See Wikimedia Commons
hesapsal karmaşıklık kuramı
Sign in to saveAlso known as complexity theory
hesaplama problemlerini kendi zorluklarına göre sınıflandırmaya ve bu sınıfları birbirleriyle ilişkilendirmeye odaklanan teorik bilgisayar bilimlerinde hesaplama teorisinin bir dalı
In the Vinony graph
Within Vinony's link graph, hesapsal karmaşıklık kuramı is referenced by 1,095 other articles, and connects out to time complexity, algorithm and Turing machine.
It sits within the topics Computational complexity theory and Computational fields of study.
Its subject is documented across 37 Wikipedia language editions.
Wikidata facts
- Instance of
- academic discipline
- Part of
- theoretical computer science
Show 7 more facts
- is the study of
- computational complexity
- facet of
- algorithm
- Stack Exchange tag
- stackoverflow.com/tags/complexity-theory
- Commons category
- Computational complexity theory
- topic's main category
- Category:Computational complexity theory
- on focus list of Wikimedia project
- Wikipedia:Vital articles/Level/4
- maintained by WikiProject
- WikiProject Mathematics
via Wikidata · CC0
Gallery (6)
Connections
time complexity
Entity
algorithm
Entity
Turing machine
Entity
travelling salesperson problem
Entity
integer factorization
Entity
NP-complete
Entity
NP-hard
Entity
PSPACE
Entity
polynomial hierarchy
Entity
♯P
Entity
EXPSPACE
Entity
random-access machine
Entity
NTIME
Entity
Circuit complexity
Entity
Arthur–Merlin protocol
Entity
Blum axioms
Entity
Cobham's thesis
Entity
biology
Entity
computer
Entity
Milan
City