Pages that link to "Item:Q5674381"

The following pages link to Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform (Q5674381):

Displaying 37 items.

• Binary determinantal complexity (Q286175) (← links)
• A note on the use of determinant for proving lower bounds on the size of linear circuits (Q294768) (← links)
• On the additive complexity of GCD and LCM matrices (Q509060) (← links)
• Min-rank conjecture for log-depth circuits (Q657911) (← links)
• Existence and efficient construction of fast Fourier transforms on supersolvable groups (Q685713) (← links)
• Entropy of operators or why matrix multiplication is hard for depth-two circuits (Q970107) (← links)
• Lower bounds in algebraic computational complexity (Q1057648) (← links)
• The trade-off between the additive complexity and the asynchronicity of linear and bilinear algorithms (Q1069699) (← links)
• On the computational complexity of the general discrete Fourier transform (Q1094136) (← links)
• Fast generalized Fourier transforms (Q1123578) (← links)
• Application of separability and independence notions for proving lower bounds of circuit complexity (Q1147680) (← links)
• The lower bounds on the additive complexity of bilinear problems in terms of some algebraic quantities (Q1157165) (← links)
• Additive complexity in directed computations (Q1164996) (← links)
• Size bounds for superconcentrators (Q1170885) (← links)
• Invariant and geometric aspects of algebraic complexity theory. I (Q1176389) (← links)
• Fast modular transforms (Q1216049) (← links)
• Lower bounds for polynomial evaluation and interpolation problems (Q1386175) (← links)
• Spectral methods for matrix rigidity with applications to size-depth trade-offs and communication complexity (Q1604200) (← links)
• On Bellman's and Knuth's problems and their generalizations (Q1791767) (← links)
• Matrix rigidity (Q1970501) (← links)
• Lower bounds for matrix factorization (Q2041242) (← links)
• Comparing the computational complexity of monomials and elements of finite abelian groups (Q2088733) (← links)
• The complexity of computing (almost) orthogonal matrices with \(\varepsilon\)-copies of the Fourier transform (Q2224843) (← links)
• On the arithmetic operational complexity for solving Vandermonde linear equations (Q2258368) (← links)
• Cancellation-free circuits in unbounded and bounded depth (Q2348031) (← links)
• Arithmetic complexity of certain linear transformations (Q2352607) (← links)
• The arithmetic computational complexity of linear transforms (Q2356497) (← links)
• A sparse fast Fourier algorithm for real non-negative vectors (Q2357452) (← links)
• Lower bounds for off-line range searching (Q2365324) (← links)
• A nonlinear lower bound for constant depth arithmetical circuits via the discrete uncertainty principle (Q2378541) (← links)
• Relation between two measures of the computation complexity for systems of monomials (Q2513077) (← links)
• An Omega((n log n)/R) Lower Bound for Fourier Transform Computation in the R-Well Conditioned Model (Q2828217) (← links)
• Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness (Q4993271) (← links)
• Lower Bounds for Multiplication via Network Coding (Q5091158) (← links)
• Lower bounds for matrix factorization (Q5092452) (← links)
• A super-quadratic lower bound for depth four arithmetic circuits (Q5092474) (← links)
• On the computation complexity of the systems of finite abelian group elements (Q6154999) (← links)