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

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-030-43662-9_7
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer International Publishing

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

Some Order Dimension Bounds for Communication Complexity Problems

Acta Informatica
Computer NetworksSoftwareInformation SystemsCommunications
1991English

Lower Bounds for the Linear Complexity of Sequences Over Residue Rings

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1991English

Bounds on the Kolmogorov Complexity Function for Infinite Words

2016English

The Complexity of Theorem-Proving Procedures

1971English

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

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Tight Bounds on the Complexity of the Apostolico-Giancarlo Algorithm

Information Processing Letters
Signal ProcessingComputer Science ApplicationsInformation SystemsTheoretical Computer Science
1997English

Bounds on the Complexity of the Longest Common Subsequence Problem

Journal of the ACM
ControlSystems EngineeringInformation SystemsHardwareArchitectureArtificial IntelligenceSoftware
1976English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy