Quick Approximation to Matrices and Applications
- 1 February 1999
- journal article
- research article
- Published by Springer Science and Business Media LLC in Combinatorica
- Vol. 19 (2), 175-220
- https://doi.org/10.1007/s004930050052
Abstract
No abstract availableThis publication has 2 references indexed in Scilit:
- How hard is it to marry at random? (On the approximation of the permanent)Published by Association for Computing Machinery (ACM) ,1986
- Some simplified NP-complete graph problemsTheoretical Computer Science, 1976