This HTML5 document contains 170 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
n23http://dbpedia.org/resource/File:
foafhttp://xmlns.com/foaf/0.1/
n9https://global.dbpedia.org/id/
yagohttp://dbpedia.org/class/yago/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
dbpedia-nnhttp://nn.dbpedia.org/resource/
freebasehttp://rdf.freebase.com/ns/
dbpedia-pthttp://pt.dbpedia.org/resource/
dbpedia-cshttp://cs.dbpedia.org/resource/
n17http://commons.wikimedia.org/wiki/Special:FilePath/
dbpedia-fahttp://fa.dbpedia.org/resource/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Algorithmic_efficiency
dbo:wikiPageWikiLink
dbr:Computational_complexity_of_mathematical_operations
Subject Item
dbr:Arbitrary-precision_arithmetic
dbo:wikiPageWikiLink
dbr:Computational_complexity_of_mathematical_operations
Subject Item
dbr:List_of_numerical_analysis_topics
dbo:wikiPageWikiLink
dbr:Computational_complexity_of_mathematical_operations
Subject Item
dbr:Computational_complexity_of_matrix_multiplication
dbo:wikiPageWikiLink
dbr:Computational_complexity_of_mathematical_operations
Subject Item
dbr:Matrix_multiplication_algorithm
dbo:wikiPageWikiLink
dbr:Computational_complexity_of_mathematical_operations
Subject Item
dbr:Mohammed_I._Al-Suwaiyel
dbo:wikiPageWikiLink
dbr:Computational_complexity_of_mathematical_operations
Subject Item
dbr:MAXEkSAT
dbo:wikiPageWikiLink
dbr:Computational_complexity_of_mathematical_operations
Subject Item
dbr:Computational_complexity
dbo:wikiPageWikiLink
dbr:Computational_complexity_of_mathematical_operations
Subject Item
dbr:Computational_complexity_of_mathematical_operations
rdf:type
yago:Attribute100024264 yago:WikicatNumberTheoreticAlgorithms yago:YagoPermanentlyLocatedEntity yago:Act100030358 yago:Event100029378 yago:Activity100407535 yago:PsychologicalFeature100023100 yago:Algorithm105847438 yago:Rule105846932 yago:Condition113920835 yago:Problem114410605 yago:Abstraction100002137 yago:Procedure101023820 yago:State100024720 yago:WikicatUnsolvedProblemsInComputerScience yago:WikicatComputerArithmeticAlgorithms yago:Difficulty114408086
rdfs:label
Výpočetní složitost matematických operací Computational complexity of mathematical operations Complexidade computacional de operações matemáticas
rdfs:comment
The following tables list the computational complexity of various algorithms for common mathematical operations. Here, complexity refers to the time complexity of performing computations on a multitape Turing machine. See big O notation for an explanation of the notation used. Note: Due to the variety of multiplication algorithms, below stands in for the complexity of the chosen multiplication algorithm. As tabelas a seguir listam o tempo de execução de vários algoritmos para comuns. Aqui, a complexidade refere-se à complexidade de tempo de execução de cálculos em uma máquina de Turing multifita. Ver a notação de Grande-O para uma explicação sobre a notação usada. Nota: Em virtude da variedade de algoritmos de multiplicação, M(n) fica abaixo na complexidade do algoritmo de multiplicação escolhido. Následující tabulky uvádějí časovou složitost matematických operací. S ohledem na to, že efektivita značné části složitějších operací závisí na efektivitě implementace násobení, kterou používají, je v patřičných vzorcích použito pro naznačení této skutečnosti.
foaf:depiction
n17:Comparison_computational_complexity.svg
dcterms:subject
dbc:Unsolved_problems_in_computer_science dbc:Computational_complexity_theory dbc:Computer_arithmetic_algorithms dbc:Mathematics-related_lists dbc:Number_theoretic_algorithms
dbo:wikiPageID
6497220
dbo:wikiPageRevisionID
1123129259
dbo:wikiPageWikiLink
dbr:LU_decomposition dbr:Gauss–Jordan_elimination dbr:Newton's_method dbr:Triangular_matrix dbr:Pi dbc:Mathematics-related_lists dbr:Quantum_computer dbr:Long_division dbr:Arithmetic–geometric_mean dbr:Arithmetic-geometric_mean dbr:Binary_splitting dbr:Fast_Fourier_transform dbr:Natural_logarithm dbr:Laplace_expansion dbr:General_number_field_sieve dbr:Modular_exponentiation dbr:Horner's_method dbr:Factorial dbr:Determinant dbr:Trigonometric_function dbr:Baillie–PSW_primality_test dbr:Computational_number_theory dbc:Unsolved_problems_in_computer_science dbr:Binary_GCD_algorithm dbr:Harvey-Hoeven_algorithm dbr:Mathematical_operation dbr:Newton–Raphson_division dbr:Division_(mathematics) dbr:Stehlé–Zimmermann_algorithm dbr:Mathematical_analysis dbr:Golden_ratio dbr:The_Art_of_Computer_Programming dbr:Machin's_formula dbr:Analytic_function dbr:Singular_value_decomposition dbr:Solovay–Strassen_primality_test dbr:Multiplication dbr:Chris_Umans dbr:Exponentiation_by_squaring dbr:Integral_transform dbr:Big_O_notation dbr:Robert_Kleinberg dbr:Balázs_Szegedy dbr:Computational_complexity dbr:Miller–Rabin_primality_test dbr:AKS_primality_test dbr:Floating-point_arithmetic dbr:Hypergeometric_function dbr:Computational_complexity_of_matrix_multiplication dbr:Time_complexity dbr:Agrawal's_conjecture dbr:Matrix_inversion dbr:Incomplete_gamma_function dbr:Transformation_(function) dbc:Computational_complexity_theory dbr:Matrix_multiplication_algorithm dbr:Addition dbr:Exponential_function dbr:Square_root dbr:Bit-burst_algorithm dbr:Square_root_of_2 dbr:Integer_factorization dbr:Shor's_algorithm dbr:Euclidean_algorithm dbr:Finite_field dbr:Coppersmith–Winograd_algorithm dbr:Schönhage–Strassen_algorithm dbr:Exponential_integral dbr:Multitape_Turing_machine dbr:E_(mathematical_constant) dbc:Computer_arithmetic_algorithms dbr:Euler–Mascheroni_constant dbr:Gauss–Legendre_algorithm dbr:Multiplication_algorithm dbr:Primality_test dbr:Taylor_series dbr:Toom–Cook_multiplication dbr:Jacobi_symbol dbr:Schönhage_controlled_Euclidean_descent_algorithm dbr:Strassen_algorithm dbr:Elementary_function dbr:Signal_processing dbr:Greatest_common_divisor dbr:Galactic_algorithm dbr:Henry_Cohn dbr:Gamma_function dbr:Elliptic_curve_primality_proving dbr:Algorithm dbr:Karatsuba_algorithm dbr:Number_theory dbc:Number_theoretic_algorithms dbr:Discrete_Fourier_transform n23:Comparison_computational_complexity.svg dbr:Polynomial dbr:Subtraction dbr:Bareiss_algorithm dbr:Montgomery_reduction
owl:sameAs
wikidata:Q5157305 n9:4i4e6 freebase:m.0g7nkj dbpedia-cs:Výpočetní_složitost_matematických_operací dbpedia-pt:Complexidade_computacional_de_operações_matemáticas yago-res:Computational_complexity_of_mathematical_operations dbpedia-nn:Kompleksitet_i_matematikk dbpedia-fa:پیچیدگی_محاسباتی_اعمال_ریاضی
dbp:wikiPageUsesTemplate
dbt:Main dbt:Refbegin dbt:Reflist dbt:Refend dbt:Short_description dbt:Math dbt:Clear dbt:Cite_book dbt:More_citations_needed
dbo:thumbnail
n17:Comparison_computational_complexity.svg?width=300
dbo:abstract
Následující tabulky uvádějí časovou složitost matematických operací. S ohledem na to, že efektivita značné části složitějších operací závisí na efektivitě implementace násobení, kterou používají, je v patřičných vzorcích použito pro naznačení této skutečnosti. As tabelas a seguir listam o tempo de execução de vários algoritmos para comuns. Aqui, a complexidade refere-se à complexidade de tempo de execução de cálculos em uma máquina de Turing multifita. Ver a notação de Grande-O para uma explicação sobre a notação usada. Nota: Em virtude da variedade de algoritmos de multiplicação, M(n) fica abaixo na complexidade do algoritmo de multiplicação escolhido. The following tables list the computational complexity of various algorithms for common mathematical operations. Here, complexity refers to the time complexity of performing computations on a multitape Turing machine. See big O notation for an explanation of the notation used. Note: Due to the variety of multiplication algorithms, below stands in for the complexity of the chosen multiplication algorithm.
prov:wasDerivedFrom
wikipedia-en:Computational_complexity_of_mathematical_operations?oldid=1123129259&ns=0
dbo:wikiPageLength
24585
foaf:isPrimaryTopicOf
wikipedia-en:Computational_complexity_of_mathematical_operations
Subject Item
dbr:Computational_complexity_theory
dbo:wikiPageWikiLink
dbr:Computational_complexity_of_mathematical_operations
Subject Item
dbr:Strassen_algorithm
dbo:wikiPageWikiLink
dbr:Computational_complexity_of_mathematical_operations
Subject Item
dbr:Dynamic_programming
dbo:wikiPageWikiLink
dbr:Computational_complexity_of_mathematical_operations
Subject Item
dbr:Quantum_machine_learning
dbo:wikiPageWikiLink
dbr:Computational_complexity_of_mathematical_operations
Subject Item
dbr:Counting_points_on_elliptic_curves
dbo:wikiPageWikiLink
dbr:Computational_complexity_of_mathematical_operations
Subject Item
dbr:Big_O_notation
dbo:wikiPageWikiLink
dbr:Computational_complexity_of_mathematical_operations
Subject Item
dbr:Born–Oppenheimer_approximation
dbo:wikiPageWikiLink
dbr:Computational_complexity_of_mathematical_operations
Subject Item
dbr:Broyden–Fletcher–Goldfarb–Shanno_algorithm
dbo:wikiPageWikiLink
dbr:Computational_complexity_of_mathematical_operations
Subject Item
dbr:Parallel_multidimensional_digital_signal_processing
dbo:wikiPageWikiLink
dbr:Computational_complexity_of_mathematical_operations
Subject Item
wikipedia-en:Computational_complexity_of_mathematical_operations
foaf:primaryTopic
dbr:Computational_complexity_of_mathematical_operations