Browse using
OpenLink Faceted Browser
OpenLink Structured Data Editor
LodLive Browser
Formats
RDF:
N-Triples
N3
Turtle
JSON
XML
OData:
Atom
JSON
Microdata:
JSON
HTML
Embedded:
JSON
Turtle
Other:
CSV
JSON-LD
Faceted Browser
Sparql Endpoint
About:
Computational complexity
An Entity of Type:
Thing
,
from Named Graph:
http://dbpedia.org
,
within Data Space:
dbpedia.org
Measure of the amount of resources needed to run an algorithm or solve a computational problem
Property
Value
dbo:
description
bir algoritma çalıştırmak veya bir hesaplama problemini çözmek için gereken kaynak miktarının ölçülmesi
(tr)
מדד לכמות המשאבים הנדרשים אלגוריתם כדי לפתור בעיה חישובית
(iw)
medida de la cantidad de recursos estrictamente necesarios para ejecutar un algoritmo que resuelve un problema computacional
(es)
Kompliziertheit von Problemen, Algorithmen oder Daten
(de)
algoritmin suorittamiseen tai laskennalisen ongelman ratkaisuun tarvittavat resurssit
(fi)
measure of the amount of resources needed to run an algorithm or solve a computational problem
(en)
мера ресурсов, требуемых для выполнения алгоритма
(ru)
misura della quantità di risorse intrinsecamente necessarie per eseguire un algoritmo che risolva un problema computazionale
(it)
dbo:
wikiPageExternalLink
http://www.cs.princeton.edu/theory/complexity/
http://www.wisdom.weizmann.ac.il/~oded/cc-book.html
dbo:
wikiPageInterLanguageLink
http://zh-yue.dbpedia.org/resource/運算複雜度
dbo:
wikiPageWikiLink
dbr
:Knapsack_problem
dbr
:Computer_memory
dbr
:Space_complexity
dbr
:Computer_hardware
dbr
:Gaussian_elimination
dbr
:Random-access_machine
dbr
:Lambda_calculus
dbc
:Computational_resources
dbr
:Post-quantum_cryptography
dbr
:Sorting
dbr
:Complex_number
dbr
:Cambridge_University_Press
dbr
:NP_(complexity)
dbr
:Modular_arithmetic
dbr
:Quicksort
dbr
:Multitape_Turing_machine
dbr
:Worst-case_complexity
dbr
:Big_O_notation
dbc
:Analysis_of_algorithms
dbr
:Combinatorics
dbr
:MIT_Press
dbr
:Analysis_of_algorithms
dbc
:Computational_complexity_theory
dbr
:Computer
dbr
:Quantum_mechanics
dbr
:Inverse_function
dbr
:Integer_matrix
dbr
:Computer_network
dbr
:Algorithm
dbr
:Algorithm_design
dbr
:Bit
dbr
:Computer_algebra
dbr
:Quantum_computing
dbr
:Cryptographic_protocol
dbr
:Computer_science
dbr
:Multiplication
dbr
:Determinant
dbr
:Merge_sort
dbr
:Computational_complexity_theory
dbr
:Boolean_satisfiability_problem
dbr
:Moore's_law
dbr
:Bibliography
dbr
:Complexity_class
dbr
:System_of_polynomial_equations
dbr
:Introduction_to_the_Theory_of_Computation
dbr
:Asymptotic_analysis
dbr
:Search_algorithm
dbr
:Radix
dbr
:Chinese_Postman_Problem_Complexity_List
dbr
:Average-case_complexity
dbr
:Exponential_function
dbr
:Sorting_algorithm
dbr
:Time_complexity
dbr
:Computational_problem
dbr
:Big_data
dbr
:Turing_machine
dbr
:Travelling_salesman_problem
dbr
:Exponential_growth
dbr
:Shor's_algorithm
dbr
:Bézout's_theorem
dbr
:Model_of_computation
dbr
:Computational_complexity_of_mathematical_operations
dbr
:Infimum
dbr
:Quantum_complexity_theory
dbr
:NP-complete
dbr
:Μ-recursive_function
dbr
:Polynomial_time
dbr
:Linear_time
dbr
:Upper_bound
dbr
:Quantum_algorithms
dbr
:John_Wiley_&_Sons
dbr
:Quantum_computer
dbr
:Non-deterministic_Turing_machine
dbr
:NP-complete_problem
dbr
:Stirling's_formula
dbr
:P_=_NP
dbr
:P_≠_NP
dbr
:Thomson_Learning
dbr
:Big_omega_notation
dbr
:Binary_representation
dbr
:Church–Turing_thesis_(complexity_theory)
dbr
:Deterministic_model
dbr
:Distributed_computation
dbr
:Entangled_state
dbr
:Soft_O_notation
dbr
:Arithmetic_operations
dbr
:Computational_algebraic_geometry
dbr
:Machine_word
dbr
:Non-deterministic_algorithm
dbr
:Models_of_computation
dbp:
wikiPageUsesTemplate
dbt
:Main
dbt
:Reflist
dbt
:Math
dbt
:Anchor
dbt
:Hatnote
dbt
:See_also
dbt
:Citation
dbt
:Garey-Johnson
dbt
:Computer_science
dbt
:As_of
dbt
:CS1_config
dbt
:Citation_needed
dbt
:Mvar
dbt
:Main_article
dbt
:More_footnotes
dbt
:Short_description
dct:
subject
dbc
:Computational_resources
dbc
:Analysis_of_algorithms
dbc
:Computational_complexity_theory
rdfs:
label
Computational complexity
(en)
Complexitat computacional
(ca)
Komplexität (Informatik)
(de)
Złożoność obliczeniowa
(pl)
Complexidade computacional
(pt)
Komplexitet (beräkningsvetenskap)
(sv)
Обчислювальна складність
(uk)
Вычислительная сложность
(ru)
rdfs:
seeAlso
dbr
:Asymptotic_computational_complexity
owl:
sameAs
wikidata
:Computational complexity
dbpedia-de
:Computational complexity
dbpedia-pt
:Computational complexity
dbpedia-fa
:Computational complexity
dbpedia-ru
:Computational complexity
dbpedia-sv
:Computational complexity
dbpedia-vi
:Computational complexity
dbpedia-pl
:Computational complexity
dbpedia-et
:Computational complexity
dbpedia-ca
:Computational complexity
dbpedia-gl
:Computational complexity
dbpedia-lt
:Computational complexity
dbpedia-uk
:Computational complexity
dbpedia-global
:Computational complexity
prov:
wasDerivedFrom
wikipedia-en
:Computational_complexity?oldid=1283260642&ns=0
foaf:
isPrimaryTopicOf
wikipedia-en
:Computational_complexity
is
dbo:
academicDiscipline
of
dbr
:Phokion_G._Kolaitis
dbr
:Nimrod_Megiddo
dbr
:Naveen_Garg
is
dbo:
knownFor
of
dbr
:Avi_Wigderson
dbr
:Constantinos_Daskalakis
is
dbo:
wikiPageDisambiguates
of
dbr
:Complexity_(disambiguation)
is
dbo:
wikiPageRedirects
of
dbr
:Computational_Complexity
dbr
:Computational_Complexity
dbr
:Context_of_computational_complexity
dbr
:Bit_complexity
dbr
:Complexity_of_computation_(bit)
dbr
:Computational_complexities
dbr
:Asymptotic_complexity
is
dbo:
wikiPageWikiLink
of
dbr
:Gröbner_basis
dbr
:Non-local_means
dbr
:Time_Warp_Edit_Distance
dbr
:International_Symposium_on_Fundamentals_of_Computation_Theory
dbr
:Pairwise_compatibility_graph
dbr
:Robust_principal_component_analysis
dbr
:Phokion_G._Kolaitis
dbr
:T-symmetry
dbr
:Automata_theory
dbr
:Computational_mathematics
dbr
:Division_algorithm
dbr
:Synthetic-aperture_radar
dbr
:Matrix_multiplication
dbr
:Real_closed_field
dbr
:Satisfiability_modulo_theories
dbr
:Artificial_intelligence
dbr
:First-order_logic
dbr
:Factorial
dbr
:System_on_a_chip
dbr
:Hindley–Milner_type_system
dbr
:Simultaneous_equations_model
dbr
:Analysis_of_parallel_algorithms
dbr
:Timeline_of_quantum_computing_and_communication
dbr
:Bareiss_algorithm
dbr
:Dexter_Kozen
dbr
:Nasir_Ahmed_(engineer)
dbr
:Abstract_interpretation
dbr
:Amortized_analysis
dbr
:Analysis_of_algorithms
dbr
:Greatest_common_divisor
dbr
:Mathematics
dbr
:Complexity_theory
dbr
:Gaussian_process_approximations
dbr
:Integrated_information_theory
dbr
:Stochastic_gradient_descent
dbr
:Sergi_Oliva
dbr
:Geometrical_properties_of_polynomial_roots
dbr
:Kernel_(linear_algebra)
dbr
:Maximum_likelihood_estimation
dbr
:Load_balancing_(computing)
dbr
:Mathematical_induction
dbr
:Quantum_computing
dbr
:Stanford_Research_Institute_Problem_Solver
dbr
:Transitive_reduction
dbr
:Timed_automaton
dbr
:Felipe_Cucker
dbr
:Donald_Knuth
dbr
:Linear_algebra
dbr
:Avi_Wigderson
dbr
:Multiplication_algorithm
dbr
:Computational_complexity_theory
dbr
:Dynamic_logic_(modal_logic)
dbr
:Likelihood_function
dbr
:Hankel_transform
dbr
:Complexity_class
dbr
:Simulation_hypothesis
dbr
:Toom–Cook_multiplication
dbr
:System_of_polynomial_equations
dbr
:Interval_order
dbr
:Search_algorithm
dbr
:Wald_test
dbr
:Kalman_filter
dbr
:Sturm's_theorem
dbr
:Discrete_system
dbr
:Audio_watermark
dbr
:T-norm_fuzzy_logics
dbr
:Algebraic_geometry
dbr
:Fermat's_theorem_on_sums_of_two_squares
dbr
:Matrix_chain_multiplication
dbr
:Time_complexity
dbr
:Computational_problem
dbr
:Minimum-distance_estimation
dbr
:Square-free_polynomial
dbr
:Polynomial_ring
dbr
:Glossary_of_artificial_intelligence
dbr
:Informatics
dbr
:Glossary_of_mathematical_symbols
dbr
:Graph_(discrete_mathematics)
dbr
:Cramer's_rule
dbr
:Graph_homomorphism
dbr
:LU_decomposition
dbr
:Cosine_similarity
dbr
:Allan_Borodin
dbr
:Communication_complexity
dbr
:Complexity_(disambiguation)
dbr
:Hilbert_series_and_Hilbert_polynomial
dbr
:Michael_Garey
dbr
:Transversal_(combinatorics)
dbr
:Passing–Bablok_regression
dbr
:Rybicki_Press_algorithm
dbr
:Hamiltonian_simulation
dbr
:Model_of_computation
dbr
:Compression_theorem
dbr
:Computational_complexity_of_mathematical_operations
dbr
:Computer_graphics_lighting
dbr
:Constantinos_Daskalakis
dbr
:UCPH_Department_of_Computer_Science
dbr
:Softmax_function
dbr
:Benjamin_Rossman
dbr
:Not-all-equal_3-satisfiability
dbr
:Root-finding_algorithms
dbr
:Paola_Bonizzoni
dbr
:Heckman_correction
dbr
:Hidden-line_removal
dbr
:Stacker_crane_problem
dbr
:Russell_Impagliazzo
dbr
:Tarski–Seidenberg_theorem
dbr
:Quantum_machine_learning
dbr
:Real-root_isolation
dbr
:Reconfiguration
dbr
:Rotation_distance
dbr
:Art_Gallery_Theorems_and_Algorithms
dbr
:Oracle_complexity_(optimization)
dbr
:The_Tower_of_Hanoi_–_Myths_and_Maths
dbr
:Ilya_Kapovich
dbr
:M._Grazia_Speranza
dbr
:Machine_learning_in_video_games
dbr
:Semi-global_matching
dbr
:Guided_filter
dbr
:Cristina_G._Fernandes
dbr
:Chemical_graph_generator
dbr
:Nimrod_Megiddo
dbr
:Paul_Schupp
dbr
:L1-norm_principal_component_analysis
dbr
:Lattice_of_stable_matchings
dbr
:RSA_Award_for_Excellence_in_Mathematics
dbr
:Hybrid_stochastic_simulation
dbr
:Nicola_Leone
dbr
:Linear_equation_over_a_ring
dbr
:Computational_complexity_of_matrix_multiplication
dbr
:Crossing_Numbers_of_Graphs
dbr
:Existential_risk_from_artificial_general_intelligence
dbr
:Computational_Complexity
dbr
:NLTS_Conjecture
dbr
:Context_of_computational_complexity
dbr
:Bit_complexity
dbr
:Complexity_of_computation_(bit)
dbr
:Computational_complexities
dbr
:Asymptotic_complexity
is
dbp:
field
of
dbr
:Phokion_G._Kolaitis
dbr
:Nimrod_Megiddo
is
dbp:
knownFor
of
dbr
:Avi_Wigderson
is
rdfs:
seeAlso
of
dbr
:Quantum_complexity_theory
is
foaf:
primaryTopic
of
wikipedia-en
:Computational_complexity
This content was extracted from
Wikipedia
and is licensed under the
Creative Commons Attribution-ShareAlike 4.0 International