Proof verification and the hardness of approximation problems
[DBLP_Link] [Online_Version] CitedBy 1255 [PDF]- Year: 1998
- Article: Electronic Colloquium on Computational Complexity (ECCC)
-
Authors:
Sanjeev Arora
(Professor of Computer Science, Computer Science Princeton University)
H-index: 23; Papers: 47; Citation: 6971 [FOAF] Homepage: http://www.cs.princeton.edu/~arora/ Expertise: Communication Complexity / Lower Bounds;
Carsten Lund
H-index: 31; Papers: 61; Citation: 8997 [FOAF] Homepage: http://www.research.att.com/viewPage.cfm?PageID=585 Expertise: Communication Complexity / Lower Bounds; Wireless network / End-to-end Routing Behavior; Signature Schemes / Authenticated Key Exchange Secure;
Rajeev Motwani
(Professor and Director of Graduate Studies, Stanford University)
H-index: 72; Papers: 183; Citation: 39124 [FOAF] Homepage: http://theory.stanford.edu/~rajeev/ Expertise: Communication Complexity / Lower Bounds; XML Data; Approximation Algorithms / Perfect Graphs; Convex Polygons / Planar Arrangements;
Madhu Sudan
(Professor, Computer Science & AI Laboratory (CSAIL) Theory of Computing (TOC) group in CSAIL)
H-index: 61; Papers: 158; Citation: 15060 [FOAF] Homepage: http://people.csail.mit.edu/madhu/ Expertise:
Mario Szegedy
(Professor , Department of Computer Science State University of NJ )
H-index: 29; Papers: 77; Citation: 7663 [FOAF] Homepage: http://www.cs.rutgers.edu/~szegedy/ Expertise: Communication Complexity / Lower Bounds; Approximation Algorithms / Perfect Graphs; Convex Polygons / Planar Arrangements;
Other Format:LNCS: [Top]
IEEE:
ACM:
Latex: