This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
35th Annual Symposium on Foundations of Computer Science (FOCS 1994)
Santa Fe, NM, USA
November 20-November 22
ISBN: 0-8186-6580-7
S. Khanna, Dept. of Comput. Sci., Stanford Univ., CA, USA
R. Motwani, Dept. of Comput. Sci., Stanford Univ., CA, USA
We attempt to reconcile the two distinct views of approximation classes: syntactic and computational. Syntactic classes such as MAX SNP permit structural results and have natural complete problems, while computational classes such as APX allow us to work with classes of problems whose approximability is well-understood. Our results provide a syntactic characterization of computational classes, and give a computational framework for syntactic classes.
Index Terms:
computational classes, computational views, approximability, approximation classes, syntactic, MAX SNP, structural results
Citation:
S. Khanna, R. Motwani, M. Sudan, U. Vazirani, "On syntactic versus computational views of approximability," focs, pp.819-830, 35th Annual Symposium on Foundations of Computer Science (FOCS 1994), 1994
Usage of this product signifies your acceptance of the Terms of Use.