Pages that link to "Item:Q2639101"
From MaRDI portal
The following pages link to Boolean circuits versus arithmetic circuits (Q2639101):
Displaying 13 items.
- Efficient and optimal exponentiation in finite fields (Q685709) (← links)
- Modular composition via factorization (Q722764) (← links)
- Counting classes and the fine structure between \(\mathrm{NC}^1\) and \(L\) (Q764326) (← links)
- Arithmetizing classes around {\textsf{NC}}\(^{1}\) and {\textsf{L}} (Q968272) (← links)
- Feasible arithmetic computations: Valiant's hypothesis (Q1114391) (← links)
- Polar varieties, real equation solving, and data structures: the hypersurface case (Q1361872) (← links)
- Parallel evaluation of arithmetic circuits (Q1365929) (← links)
- Computing Frobenius maps and factoring polynomials (Q2366168) (← links)
- The enumerability of P collapses P to NC (Q2575747) (← links)
- Inversion in finite fields using logarithmic depth (Q2638778) (← links)
- A super-quadratic lower bound for depth four arithmetic circuits (Q5092474) (← links)
- Univariate polynomial factorization over finite fields with large extension degree (Q6122401) (← links)
- Scalable multiparty computation from non-linear secret sharing (Q6653034) (← links)
