Amanote Research

Amanote Research

    RegisterSign In

Lower Bounds for Local Monotonicity Reconstruction From Transitive-Closure Spanners

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-15369-3_34
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2010

Authors
Arnab BhattacharyyaElena GrigorescuMadhav JhaKyomin JungSofya RaskhodnikovaDavid P. Woodruff
Publisher

Springer Berlin Heidelberg


Related search

Transitive-Closure Spanners

2009English

A Hierarchy of Lower Bounds for Sublinear Additive Spanners

2017English

A Transitive Closure Algorithm

BIT Numerical Mathematics
Computer NetworksApplied MathematicsSoftwareComputational MathematicsCommunications
1970English

Upper and Lower Bounds, and Operator Monotonicity of an Extension of the Petz-Hasegawa Function

Mathematical Inequalities and Applications
MathematicsApplied Mathematics
2018English

Uniform Derandomization From Pathetic Lower Bounds

Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
MathematicsEngineeringAstronomyPhysics
2012English

Graph Encoding and Transitive Closure Representation

English

Lower Bounds

2016English

Lower Bounds for Subgraph Isomorphism

2019English

Lower Bounds for Z-Numbers

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
2009English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy