Randomness-optimal unique element isolation, with applications to perfect matching and related problems
From MaRDI portal
Publication:5248515
DOI10.1145/167088.167213zbMath1310.68102OpenAlexW1977093964WikidataQ56569489 ScholiaQ56569489MaRDI QIDQ5248515
Suresh Chari, Pankaj Rohatgi, Aravind Srinivasan
Publication date: 7 May 2015
Published in: Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/1813/6129
Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10)
Related Items (4)
Parameterized random complexity ⋮ On quasilinear-time complexity theory ⋮ On the number of random bits in totally private computation ⋮ Non-commutative arithmetic circuits: depth reduction and size lower bounds
This page was built for publication: Randomness-optimal unique element isolation, with applications to perfect matching and related problems
