scientific article; zbMATH DE number 3566175

Cited in

(36)

Size-space tradeoffs for oblivious computations
A consideration of a practical implementation for a new convergence division
Data subset selection by Boolean calculation
An \(\Omega (n^{4/3})\) lower bound on the monotone network complexity of the \(n\)-th degree convolution
On the complexity of slice functions
Linear lower bounds on unbounded fan-in Boolean circuits
The performance of multilective VLSI algorithms
Tautologies with a unique Craig interpolant, uniform vs. nonuniform complexity
More on the complexity of slice functions
Polynomial division and its computational complexity
Algebraic complexity of computing polynomial zeros
Sequential and parallel complexity of approximate evaluation of polynomial zeros
Complexity of parallel matrix computations
Models of lower-bounds proofs
A lower bound for read-once-only branching programs
A logarithmic Boolean time algorithm for parallel polynomial division
Entropy of contact circuits and lower bounds on their complexity
Efficient parallel circuits and algorithms for division
Meanders and their applications in lower bounds arguments
Functions computed by monotone Boolean formulas with no repeated variables
Switching functions whose monotone complexity is nearly quadratic
Displacement ranks of matrices and linear equations
Negation can be exponentially powerful
On the complexity of 2-output Boolean networks
Nonlinear lower bounds on the number of processors of circuits with sublinear separators
Nonuniform complexity and the randomness of certain complete languages
Lower bounds on the area complexity of Boolean circuits
Threshold circuits of small majority-depth
Analog computation via neural networks
Complexity of Boolean functions over bases with unbounded fan-in gates
Relating monotone formula size and monotone depth of Boolean functions
Randomised algorithms
Optimal and nearly optimal algorithms for approximating polynomial zeros
Probabilistic parallel prefix computation
A nonlinear lower bound on the practical combinational complexity
Prediction-preserving reducibility

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4138141)