Search the dblp DataBase

Publications of Author

1. Per Austrin
   Balanced max 2-sat might not be the hardest. [Citation Graph (0, 0)][DBLP]
   STOC, 2007, pp:189-197 [Conf]
   
2. 
   Improved Inapproximability for Submodular Maximization. [Citation Graph (, )][DBLP]
   
   
3. 
   Approximation Resistant Predicates from Pairwise Independence. [Citation Graph (, )][DBLP]
   
   
4. 
   Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs. [Citation Graph (, )][DBLP]
   
   
5. 
   Towards Sharp Inapproximability For Any 2-CSP. [Citation Graph (, )][DBLP]
   
   
6. 
   On Quadratic Threshold CSPs. [Citation Graph (, )][DBLP]
   
   
7. 
   Randomly supported independence and resistance. [Citation Graph (, )][DBLP]
   
   
8. 
   Lower Bounds for Subset Cover Based Broadcast Encryption. [Citation Graph (, )][DBLP]
   
   
9. 
   Approximation Resistant Predicates from Pairwise Independence. [Citation Graph (, )][DBLP]
   
   
10. 
    Approximation Resistant Predicates From Pairwise Independence [Citation Graph (, )][DBLP]
    
    
11. 
    Improved Inapproximability For Submodular Maximization [Citation Graph (, )][DBLP]
    
    
12. 
    Approximation Resistant Predicates From Pairwise Independence. [Citation Graph (, )][DBLP]
    
    
13. 
    Balanced Max 2-Sat might not be the hardest. [Citation Graph (, )][DBLP]