Amanote Research

Amanote Research

    RegisterSign In

Deterministic Algorithms for the Lovász Local Lemma

SIAM Journal on Computing - United States
doi 10.1137/100799642
Full Text
Open PDF
Abstract

Available in full text

Categories
MathematicsComputer Science
Date

January 1, 2013

Authors
Karthekeyan ChandrasekaranNavin GoyalBernhard Haeupler
Publisher

Society for Industrial & Applied Mathematics (SIAM)


Related search

Lopsidependency in the Moser-Tardos Framework: Beyond the Lopsided Lovász Local Lemma

2014English

On Preparing Ground States of Gapped Hamiltonians: An Efficient Quantum Lovász Local Lemma

2017English

Deterministic Local Algorithms, Unique Identifiers, and Fractional Graph Colouring

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Deterministic Algorithms for Submodular Maximization Problems

2015English

Primal-Dual Algorithms for Deterministic Inventory Problems

Mathematics of Operations Research
Management ScienceComputer Science ApplicationsOperations ResearchMathematics
2006English

Algorithms for Computing Nash Equilibria in Deterministic LQ Games

Computational Management Science
Information SystemsManagement Information Systems
2006English

Internally Deterministic Parallel Algorithms Can Be Fast

ACM SIGPLAN Notices
Computer Science
2012English

Hardness Amplification Within NP Against Deterministic Algorithms

2008English

Deterministic and Stochastic Primal-Dual Subgradient Algorithms for Uniformly Convex Minimization

Stochastic Systems
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy