The Lovász Local Lemma and Satisfiability - Algorithmic Aspects

Source URL: conference.itcs.tsinghua.edu.cn

A simple D 2 -sampling based PTAS for k-means and other Clustering problems Ragesh Jaiswal1 , Amit Kumar1 , and Sandeep Sen1 Department of Computer Science and Engineering, Indian Institute of Technology Delhi. {rjaiswal

Source URL: www.cse.iitd.ernet.in

• Statistics
• Combinatorics
• Lemmas
• Algorithmic Lovász local lemma
• Randomized algorithm
• Mathematics
• XTR
• K-means clustering

Sum of Squares Upper Bounds, Lower Bounds, and Open Questions Boaz Barak December 10, 2014 2

Source URL: www.boazbarak.org

• Algorithm
• Clique problem
• Combinatorics
• NP
• PP
• Proof complexity
• Algorithmic Lovász local lemma
• Switching lemma
• Theoretical computer science
• Computational complexity theory
• Applied mathematics

Distrib. Comput[removed]DOI[removed]s00446[removed]SPECIAL ISSUE: DISC 04 Hagit Attiya · Fabian Kuhn · C. Greg Plaxton ·

Source URL: distcomp.ethz.ch

• Analysis of algorithms
• Probabilistic complexity theory
• Randomized algorithm
• SL
• Time complexity
• Matching
• Algorithm
• Algorithmic Lovász local lemma
• Immerman–Szelepcsényi theorem
• Theoretical computer science
• Computational complexity theory
• Applied mathematics