In the Vinony graph
Within Vinony's link graph, خوارزمية شور is referenced by 309 other articles, and connects out to division algorithm, multiplication algorithm and coprime.
Vinony files it under Integer factorization algorithms, Post-quantum cryptography and Quantum algorithms.
Its subject is documented across 32 Wikipedia language editions.
Wikidata facts
Show 1 more fact
- time of discovery or invention
- 1994-00-00
Sources (2)
via Wikidata · CC0
Article · العربية
خوارزمية شوور (بالإنجليزية: Shor's algorithm) هي خوارزمية لتفكيك عدد طبيعي N في زمن ((log N)3) وفي مساحة (O(log N. تحمل هاته الخوارزمية اسم بيتر شور.
Abstract from DBpedia / Wikipedia · CC BY-SA
Connections
division algorithm
Entity
multiplication algorithm
Entity
coprime
Entity
time complexity
Entity
long division
Entity
International Standard Book Number
Entity
algorithm
Entity
prime number
Entity
number theory
Entity
Wayback Machine
Entity
IBM
Entity
digital object identifier
Entity
group
Entity
greatest common divisor
Entity
spin
Entity
least common multiple
Entity
nth root
Entity
quantum entanglement
Entity
Q180686
Entity
composite number
Entity