Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

From MaRDI portal

Revision as of 22:24, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5313031

Jump to:navigation, search

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

Mathematics Subject Classification ID

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 (4)

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

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5313031&oldid=19989309"