Pages that link to "Item:Q3756526"
From MaRDI portal
The following pages link to Log Depth Circuits for Division and Related Problems (Q3756526):
Displaying 50 items.
- Complexity of computation in finite fields (Q378003) (← links)
- On parallel complexity of analytic functions (Q388112) (← links)
- Efficient CRT-based residue-to-binary converter for the arbitrary moduli set (Q543164) (← links)
- Secure collaborative supply chain planning and inverse optimization -- the JELS model (Q621669) (← links)
- Root finding with threshold circuits (Q690451) (← links)
- Effective entropies and data compression (Q751832) (← links)
- A div(n) depth Boolean circuit for smooth modular inverse (Q808255) (← links)
- The random oracle model: a twenty-year retrospective (Q887442) (← links)
- Counting problems and algebraic formal power series in noncommuting variables (Q910245) (← links)
- Parallel models of computation: An introductory survey (Q916358) (← links)
- Fast arithmetics using Chinese remaindering (Q989447) (← links)
- A randomized sublinear time parallel GCD algorithm for the EREW PRAM (Q991752) (← links)
- Symmetries and the complexity of pure Nash equilibrium (Q1004282) (← links)
- Space complexity of abelian groups (Q1005925) (← links)
- Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families (Q1009352) (← links)
- Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics (Q1036536) (← links)
- Efficient parallel circuits and algorithms for division (Q1114393) (← links)
- The complexity of computing the number of strings of given length in context-free languages (Q1178713) (← links)
- Highly parallel computations modulo a number having only small prime factors (Q1184734) (← links)
- An arithmetic model of computation equivalent to threshold circuits (Q1186610) (← links)
- Multiplication, division, and shift instructions in parallel random access machines (Q1193622) (← links)
- On iterated integer product (Q1198074) (← links)
- Threshold circuits of small majority-depth (Q1273878) (← links)
- Non-commutative arithmetic circuits: depth reduction and size lower bounds (Q1274913) (← links)
- Synthesizers and their application to the parallel construction of pseudo-random functions (Q1288205) (← links)
- Expressing uniformity via oracles (Q1361886) (← links)
- On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits (Q1567407) (← links)
- A parametric error analysis of Goldschmidt's division algorithm (Q1765225) (← links)
- Efficient threshold circuits for power series (Q1854292) (← links)
- Computing a context-free grammar-generating series (Q1854451) (← links)
- Uniform constant-depth threshold circuits for division and iterated multiplication. (Q1872733) (← links)
- Isolation, matching, and counting uniform and nonuniform upper bounds (Q1961370) (← links)
- Compact designated verifier NIZKs from the CDH assumption without pairings (Q2051369) (← links)
- A \#SAT algorithm for small constant-depth circuits with PTF gates (Q2118395) (← links)
- Iterated multiplication in \(VTC^0\) (Q2155497) (← links)
- Skew circuits of small width (Q2173307) (← links)
- Expander construction in \(\mathrm{VNC}^1\) (Q2187260) (← links)
- Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 8--14, 2020 (hybrid meeting) (Q2232317) (← links)
- Polynomial time relatively computable triangular arrays for almost sure convergence (Q2315247) (← links)
- Open induction in a bounded arithmetic for \(\mathrm{TC}^{0}\) (Q2339958) (← links)
- Sieve algorithms for perfect power testing (Q2366224) (← links)
- Threshold circuits of bounded depth (Q2366275) (← links)
- Inversion in finite fields using logarithmic depth (Q2638778) (← links)
- Boolean circuits versus arithmetic circuits (Q2639101) (← links)
- On uniformity within \(NC^ 1\) (Q2640342) (← links)
- Ranking and formal power series (Q2641104) (← links)
- Ring-based identity based encryption -- asymptotically shorter MPK and tighter security (Q2697891) (← links)
- Direct computation of branching programs and its applications to more efficient lattice-based cryptography (Q2698337) (← links)
- Division in logspace-uniform NC (Q2773023) (← links)
- On design of circuits of logarithmic depth for inversion in finite fields (Q3184560) (← links)
