Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

DOI10.1007/b99805zbMath1106.68427OpenAlexW4301133941MaRDI QIDQ5313044

Luca Trevisan

Publication date: 25 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b99805

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Randomized algorithms (68W20)

Related Items (11)

A new central limit theorem and decomposition for Gaussian polynomials, with an application to deterministic approximate counting ⋮ DNF sparsification and a faster deterministic counting algorithm ⋮ Pseudorandom generators for combinatorial checkerboards ⋮ Unnamed Item ⋮ Counting Solutions to Polynomial Systems via Reductions ⋮ Not all FPRASs are equal: demystifying FPRASs for DNF-counting ⋮ Unnamed Item ⋮ Variable Influences in Conjunctive Normal Forms ⋮ Solving and sampling with many solutions ⋮ Unnamed Item ⋮ Solving and sampling with many solutions: Satisfiability and other hard problems

This page was built for publication: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques