Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

DOI10.1007/11538462zbMath1142.68449OpenAlexW2649657569MaRDI QIDQ5479383

Omer Reingold, Moni Naor, Eyal Kaplan

Publication date: 7 July 2006

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

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

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05) Permutations, words, matrices (05A05)

Related Items (3)

Layout graphs, random walks and the \(t\)-wise independence of SPN block ciphers ⋮ Limitations of the Impagliazzo-Nisan-Wigderson pseudorandom generator against permutation branching programs ⋮ Deterministic encryption with the Thorp shuffle

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