Private approximation of NP-hard functions

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2001, Pages 550-559

  Halevi, Shai ^a   Krauthgamer, Robert ^b   Kushilevitz, Eyal ^c   Nissim, Kobbi ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; PROBLEM SOLVING;

PRIVATE APPROXIMATIONS;

COMPUTATIONAL COMPLEXITY;

EID: 0034832945     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/380752.380850     Document Type: Conference Paper

References (13)

1. Improved approximation algorithms for MAX SAT
2. Approximation algorithms for NP-complete problems on planar graphs
3. Privacy, additional information, and communication
4. Interactive proofs and the hardness of approximating cliques
5. Secure multiparty computation of approximations
6. Secure multiparty computation of approximations
7. Proofs that yield nothing but their validity and a methodology of cryptographic protocol design
8. Quantifying knowledge complexity
9. Some optimal inapproximability results