Logarithmic Depth Circuits for Algebraic Functions
From MaRDI portal
Recommendations
Cited in
(40)- Polynomial division and its computational complexity
- A logarithmic Boolean time algorithm for parallel polynomial division
- Feasible arithmetic computations: Valiant's hypothesis
- Efficient parallel circuits and algorithms for division
- Parallel Hermite interpolation: An algebraic approach
- Circuits for computing the GCD of two polynomials over an algebraic number field
- The complexity of computing the number of strings of given length in context-free languages
- Highly parallel computations modulo a number having only small prime factors
- Multiplication, division, and shift instructions in parallel random access machines
- On iterated integer product
- New algorithms for polynomial and trigonometric interpolation on parallel computers
- Bits and relative order from residues, space efficiently
- Computability of the additive complexity of algebraic circuits with root extracting
- Computing a context-free grammar-generating series
- Uniform constant-depth threshold circuits for division and iterated multiplication.
- Fast parallel and serial multidimensional approximate array matching
- Open induction in a bounded arithmetic for \(\mathrm{TC}^{0}\)
- Inversion in finite fields using logarithmic depth
- Ranking and formal power series
- Descriptive complexity of deterministic polylogarithmic time and space
- Elementary analytic functions in \(\mathsf{VT}\mathsf{C}^0\)
- Division in logspace-uniform NC
- Optimal Size Integer Division Circuits
- scientific article; zbMATH DE number 3916181 (Why is no real title available?)
- Log Depth Circuits for Division and Related Problems
- Comparing the combinational complexities of arithmetic functions
- Logarithmic Depth Circuits for Hermite Interpolation
- scientific article; zbMATH DE number 619537 (Why is no real title available?)
- Computing the Additive Complexity of Algebraic Circuits with Root Extracting
- Fast parallel algorithms for polynomial division over an arbitrary field of constants
- A complete characterization of unitary quantum space
- Fast computation of divided differences and parallel Hermite interpolation
- Root finding with threshold circuits
- Planar acyclic computation
- Effective entropies and data compression
- Parallel algorithms for matrix polynomial division
- A div(n) depth Boolean circuit for smooth modular inverse
- Counting problems and algebraic formal power series in noncommuting variables
- Parallel models of computation: An introductory survey
- A parallel method for fast and practical high-order Newton interpolation
This page was built for publication: Logarithmic Depth Circuits for Algebraic Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3750999)
