Testing the shift-equivalence of polynomials using quantum machines (Q1356318): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Quantum complexity theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3321411 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4279514 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4227280 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Monte-Carlo approximation algorithms for enumeration problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4234292 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3698903 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fast Probabilistic Algorithms for Verification of Polynomial Identities / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4343414 / rank | |||
Normal rank |
Latest revision as of 13:07, 27 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Testing the shift-equivalence of polynomials using quantum machines |
scientific article |
Statements
Testing the shift-equivalence of polynomials using quantum machines (English)
0 references
27 November 2001
0 references
shift equivalences
0 references
polynomial time algorithms
0 references
quantum machine
0 references