Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
From MaRDI portal
Publication:5313031
DOI10.1007/b99805zbMath1105.68119OpenAlexW4301133941MaRDI QIDQ5313031
Don Coppersmith, Michael Ben-Or, Ronitt Rubinfeld, Mike Luby
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
Symbolic computation and algebraic computation (68W30) Specification and verification (program logics, model checking, etc.) (68Q60) Software, source code, etc. for problems pertaining to group theory (20-04)
Related Items
Quantum property testing of group solvability, On the derandomization of the graph test for homomorphism over groups, Non‐Abelian homomorphism testing, and distributions close to their self‐convolutions, Self-testing/correcting with applications to numerical problems
