Depth-4 Lower Bounds, Determinantal Complexity: A Unified Approach

Computational Complexity - Switzerland
doi 10.1007/s00037-019-00185-4
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Property Testing Lower Bounds via Communication Complexity

Computational Complexity
MathematicsComputational MathematicsTheoretical Computer ScienceComputational Theory
2012English

Some Lower Bounds for the Complexity of Continuation Methods

Journal of Complexity
ControlNumerical AnalysisStatisticsProbabilityAlgebraApplied MathematicsNumber TheoryOptimizationMathematics
1998English

Strong Bisimilarity of Simple Process Algebras: Complexity Lower Bounds

Acta Informatica
Computer NetworksSoftwareInformation SystemsCommunications
2003English

Near-Optimal Small-Depth Lower Bounds for Small Distance Connectivity

2016English

Portfolio Efficiency and Discount Factor Bounds With Conditioning Information: A Unified Approach

SSRN Electronic Journal
2002English

Lower Bounds for the Linear Complexity of Sequences Over Residue Rings

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1991English

On the Communication Complexity Methodology for Proving Lower Bounds on the Query Complexity of Property Testing

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2020English

Lower Bounds

2016English

Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy