Amanote Research

Amanote Research

    RegisterSign In

Uniform Derandomization From Pathetic Lower Bounds

Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences - United Kingdom
doi 10.1098/rsta.2011.0318
Full Text
Open PDF
Abstract

Available in full text

Categories
MathematicsEngineeringAstronomyPhysics
Date

July 28, 2012

Authors
Eric AllenderV. ArvindRahul SanthanamFengming Wang
Publisher

The Royal Society


Related search

Randomness vs Time: Derandomization Under a Uniform Assumption

Journal of Computer and System Sciences
Computer NetworksApplied MathematicsCommunicationsComputational TheoryMathematicsTheoretical Computer Science
2001English

Lower Bounds

2016English

Higher Lower Bounds From the 3SUM Conjecture

2015English

Uniform Bounds for Isoperimetric Problems

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1989English

Uniform Bounds for Bessel Functions

Journal of Applied Analysis
StatisticsProbabilityApplied MathematicsUncertaintyMathematical PhysicsMathematicsComputational Theory
2006English

Lower Bounds for Local Monotonicity Reconstruction From Transitive-Closure Spanners

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Lower Bounds for Subgraph Isomorphism

2019English

Lower Bounds for Z-Numbers

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
2009English

Lower Bounds for Dynamic Connectivity

2004English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy