Computational complexity theory

Property	Value
rdf:type	Computability and complexity topic Mathematical logic topic owl:NamedIndividual Academic discipline Computational field of study Algorithm general topic
rdfs:label	Computational complexity theory
owl:sameAs	dbr:Computational_complexity_theory
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Category:Computational_fields_of_study http://en.wikipedia.org/wiki/Outline_of_computer_programming http://en.wikipedia.org/wiki/Index_of_philosophy_articles_(A%E2%80%93C) http://en.wikipedia.org/wiki/List_of_academic_fields http://en.wikipedia.org/wiki/Sorting_algorithm http://en.wikipedia.org/wiki/List_of_computability_and_complexity_topics http://en.wikipedia.org/wiki/List_of_mathematical_logic_topics http://en.wikipedia.org/wiki/Outline_of_academic_disciplines http://en.wikipedia.org/wiki/Outline_of_software_engineering http://en.wikipedia.org/wiki/Aarhus_University_Department_of_Computer_Science http://en.wikipedia.org/wiki/Outline_of_computer_science http://en.wikipedia.org/wiki/Institute_of_Mathematics,_UFRJ http://en.wikipedia.org/wiki/Ding-Zhu_Du http://en.wikipedia.org/wiki/Juris_Hartmanis http://en.wikipedia.org/wiki/List_of_algorithm_general_topics
skos:prefLabel	Computational complexity theory
skos:altLabel	asymptotic complexity complexity computation time computational complexity linear time time complexity computational order theory complex infeasible efficiency Speedup theorem measuring numerically too complex hard hard problem computationally Complexity Complexity Theory Complexity theory Computational Complexity Computational complexity Computational complexity theory#Intractability Computational complexity theory#Reduction Computational complexity theory#tractable problem Computational_complexity_theory Computational_complexity_theory#Hierarchy_theorems Computational_complexity_theory#History Memory Complexity Computational complexity theory#Continuous complexity theory algorithmic complexity classify algorithms complex computer problems complexities complexity analysis complexity assumptions complexity classes complexity measure complexity measures complexity of a program complexity of algebraic problems complexity of algorithms complexity of computation complexity of computations complexity of the computation complexity problems complexity theoretic complexity theorist complexity theorists complexity theory complexity-theoretic complexity–theoretic computational complexity theory computational cost computational difficulty computational efficiency computational effort computational intractability results computational limits computational techniques computational-complexity-theoretic computationally complex computationally difficult computationally feasible computationally hard computationally infeasible computationally intractable computationally simple computationally too complex computations cubic time efficient algorithms higher order of complexity impractical increase exponentially input string instance size intractable intractable problems problem instance problem instances space complexity subrecursive hierarchies theoretical analyses theoretical search cost theory of computational complexity time and space complexity tractable unsolvable problem
is clgo:academicDiscipline of	Irit Dinur Scott Aaronson Shmuel Safra David Shmoys Stefan Szeider Thomas Jerome Schaefer Vijay Vazirani Georg Gottlob Virginia Vassilevska Williams Ryan Williams (computer scientist) Sheila Greibach Miklós Ajtai Christos Papadimitriou Jean-Paul Delahaye Jelani Nelson Salil Vadhan Ran Raz Umesh Vazirani Viliam Geffert
is clgo:knownFor of	Ronald V. Book Russell Impagliazzo Oscar H. Ibarra Xi Chen Nikolai Sergeevich Bakhvalov Peter Bürgisser Larry Stockmeyer

About: clgr:Computational_complexity_theory