Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy
 

Summary: Towards strong nonapproximability results in the
Lov´asz-Schrijver hierarchy
Mikhail Alekhnovich

Institute for Advanced Studies
Princeton, NJ 08540
misha@ias.edu
Sanjeev Arora

Princeton University
Computer Science
Princeton, NJ 08544
arora@cs.princeton.edu
Iannis Tourlakis
Princeton University
Computer Science
Princeton, NJ 08544
itourlak@cs.princeton.edu
ABSTRACT
Lov´asz and Schrijver described a generic method of tight-

  

Source: Arora, Sanjeev - Department of Computer Science, Princeton University

 

Collections: Computer Technologies and Information Sciences