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

doi 10.1145/2897518.2897534
Full Text
Abstract

Available in full text

Date
Authors
Publisher

ACM Press

Related search

Lower Bounds for Dynamic Connectivity

2004English

Lower Bounds for Recognizing Small Cliques on CRCW PRAM's

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
1990English

Lower Bounds for Oblivious Near-Neighbor Search

2020English

Some Bounds on the Distance-Sum-Connectivity Matrix

Journal of Inequalities and Applications
CombinatoricsApplied MathematicsAnalysisDiscrete Mathematics
2018English

Volumes of Small Balls on Open Manifolds: Lower Bounds and Examples

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1988English

Input Distance and Lower Bounds for Propositional Resolution Proof Length

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Near-Optimal Sublinear Time Algorithms for Ulam Distance

2010English

Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width

SIAM Journal on Computing
MathematicsComputer Science
2014English

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

Computational Complexity
MathematicsComputational MathematicsTheoretical Computer ScienceComputational Theory
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy