An Algorithmic Framework for Obtaining Lower Bounds for Random Ramsey Problemsextended Abstract

doi 10.1137/1.9781611973730.116
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

Extended Formulation Lower Bounds for Refuting Random CSPs

2020English

Optimal Lower Bounds for Quantum Automata and Random Access Codes

English

Lower Bounds for Solving Linear Diophantine Equations on Random Access Machines

Journal of the ACM
ControlSystems EngineeringInformation SystemsHardwareArchitectureArtificial IntelligenceSoftware
1985English

Lower Bounds for the Weak Pigeonhole Principle and Random Formulas Beyond Resolution

Information and Computation
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsInformation SystemsMathematics
2002English

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

Bounds on Classical Ramsey Numbers.

English

A Framework for ETH-tight Algorithms and Lower Bounds in Geometric Intersection Graphs

2018English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy