Pages that link to "Item:Q3798223"
From MaRDI portal
The following pages link to The parallel complexity of exponentiating polynomials over finite fields (Q3798223):
Displaying 9 items.
- Efficient and optimal exponentiation in finite fields (Q685709) (← links)
- A generalisation of Brickell's algorithm for fast modular multiplication (Q1115183) (← links)
- Encroaching lists as a measure of presortedness (Q1115201) (← links)
- The iterated mod problem (Q1119390) (← links)
- Inversion in finite fields using logarithmic depth (Q2638778) (← links)
- Boolean circuits versus arithmetic circuits (Q2639101) (← links)
- Parallel Identity Testing for Skew Circuits with Big Powers and Applications (Q2946414) (← links)
- Equality Testing of Compressed Strings (Q3449353) (← links)
- Cyclotomic identity testing and applications (Q6666517) (← links)
