Pages that link to "Item:Q1390870"

The following pages link to Testing shift-equivalence of polynomials by deterministic, probabilistic and quantum machines. (Q1390870):

Displayed 7 items.

• Zero testing of \(p\)-adic and modular polynomials (Q1575936) ‎ (← links)
• Classical and quantum function reconstruction via character evaluation (Q1827578) ‎ (← links)
• On the existence of telescopers for rational functions in three variables (Q2229731) ‎ (← links)
• An algorithm for deciding the summability of bivariate rational functions (Q2254998) ‎ (← links)
• Algebraic cryptography: new constructions and their security against provable break (Q3079281) ‎ (← links)
• On complexity of searching for periods of functions given by polynomials over a prime field (Q5878613) ‎ (← links)
• On quantum algorithms for noncommutative hidden subgroups (Q5927942) ‎ (← links)