About: Computational complexity of mathematical operations

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Computational complexity of mathematical operations Goto Sponge NotDistinct Permalink

An Entity of Type : yago:State100024720, within Data Space : dbpedia.org associated with source document(s)
QRcode icon

http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FComputational_complexity_of_mathematical_operations

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.

Attributes	Values
rdf:type	yago:WikicatComputerArithmeticAlgorithms yago:WikicatUnsolvedProblemsInComputerScience yago:WikicatNumberTheoreticAlgorithms yago:Abstraction100002137 yago:Act100030358 yago:Activity100407535 yago:Algorithm105847438 yago:Attribute100024264 yago:Condition113920835 yago:Difficulty114408086 yago:Event100029378 yago:Problem114410605 yago:Procedure101023820 yago:PsychologicalFeature100023100 yago:YagoPermanentlyLocatedEntity yago:Rule105846932 yago:State100024720
rdfs:label	Výpočetní složitost matematických operací (cs) Computational complexity of mathematical operations (en) Complexidade computacional de operações matemáticas (pt)
rdfs:comment	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. (cs) 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. (en) 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. (pt)
foaf:depiction
dcterms:subject	Number theoretic algorithms Computer arithmetic algorithms Unsolved problems in computer science Computational complexity theory Mathematics-related lists
Wikipage page ID	6497220 (xsd:integer)
Wikipage revision ID	1123129259 (xsd:integer)
Link from a Wikipage to another Wikipage	Quantum computer Elementary function Harvey-Hoeven algorithm Primality test Determinant Algorithm Hypergeometric function Integer factorization Integral transform Jacobi symbol Computational complexity of matrix multiplication Analytic function Number theoretic algorithms Mathematical analysis Matrix inversion Matrix multiplication algorithm Gauss–Legendre algorithm Schönhage–Strassen algorithm Elliptic curve primality proving Gamma function General number field sieve Golden ratio Greatest common divisor Modular exponentiation Multiplication LU decomposition Long division Shor's algorithm Signal processing Singular value decomposition Computational complexity Computational number theory Henry Cohn Horner's method Gauss–Jordan elimination Strassen algorithm Subtraction Computer arithmetic algorithms Agrawal's conjecture Time complexity Toom–Cook multiplication Trigonometric function Galactic algorithm AKS primality test Addition Unsolved problems in computer science E (mathematical constant) Euclidean algorithm Euler–Mascheroni constant Exponential function Exponentiation by squaring Finite field Floating-point arithmetic Balázs Szegedy Bareiss algorithm Number theory Fast Fourier transform Karatsuba algorithm Baillie–PSW primality test Taylor series Solovay–Strassen primality test Arithmetic-geometric mean Arithmetic–geometric mean Computational complexity theory Laplace expansion Big O notation Binary GCD algorithm Binary splitting Transformation (function)

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (62 GB total memory, 54 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software