Private approximation of NP-hard functions
- 6 July 2001
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 550-559
- https://doi.org/10.1145/380752.380850
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Quantifying knowledge complexitycomputational complexity, 1999
- Complexity and ApproximationPublished by Springer Nature ,1999
- Some optimal inapproximability resultsPublished by Association for Computing Machinery (ACM) ,1997
- Interactive proofs and the hardness of approximating cliquesJournal of the ACM, 1996
- Approximation algorithms for NP-complete problems on planar graphsJournal of the ACM, 1994
- Privacy, additional information and communicationIEEE Transactions on Information Theory, 1993
- Proofs that yield nothing but their validity and a methodology of cryptographic protocol designPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986