Limitations of Lower-Bound Methods for the Wire Complexity of Boolean Operators

doi 10.1109/ccc.2012.39
Full Text
Abstract

Available in full text

Date
Authors
Publisher

IEEE

Related search

Some Lower Bounds for the Complexity of Continuation Methods

Journal of Complexity
ControlNumerical AnalysisStatisticsProbabilityAlgebraApplied MathematicsNumber TheoryOptimizationMathematics
1998English

A Lower Bound for the Complexity of the Union-Split-Find Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1987English

A Time Complexity Lower Bound for Adaptive Mutual Exclusion

Distributed Computing
Computer NetworksHardwareCommunicationsArchitectureComputational TheoryMathematicsTheoretical Computer Science
2011English

A Lower Bound for the First Eigenvalue of Second Order Elliptic Operators

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1968English

Folding Minimal Sequences: The Lower Bound for Sequence Complexity of Globular Proteins

FEBS Letters
GeneticsCell BiologyMolecular BiologyBiochemistryStructural BiologyBiophysics
1999English

Lower-Bound Time-Complexity Analysis of Logic Programs

1997English

An Effective Lower Bound for Group Complexity of Finite Semigroups and Automata

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
2012English

A Lower Bound on Local Energy of Partial Sum of Eigenfunctions for Laplace-Beltrami Operators

ESAIM - Control, Optimisation and Calculus of Variations
ControlComputational MathematicsOptimizationSystems Engineering
2012English

Improving the Lower Bound on the Higher Order Nonlinearity of Boolean Functions With Prescribed Algebraic Immunity

IEEE Transactions on Information Theory
Computer Science ApplicationsInformation SystemsLibraryInformation Sciences
2008English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy