Search Results - Ghoshal, Suprovat

  • Showing 1 - 20 results of 20
Refine Results
  1. 1
    Tight approximation bounds for maximum multi-coverage

    Tight approximation bounds for maximum multi-coverage by Barman, Siddharth, Fawzi, Omar, Ghoshal, Suprovat, Gürpınar, Emirhan

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  2. 2
    Parameterized Intractability of Even Set and Shortest Vector Problem

    Parameterized Intractability of Even Set and Shortest Vector Problem by Bhattacharyya, Arnab, Bonnet, Édouard, Egri, László, Ghoshal, Suprovat, S., Karthik C., Lin, Bingkai, Manurangsi, Pasin, Marx, Dániel

    Published in Journal of the ACM
    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  3. 3
    New Approximation Bounds for Small-Set Vertex Expansion

    New Approximation Bounds for Small-Set Vertex Expansion by Ghoshal, Suprovat, Anand, Louis

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    On Lifting Integrality Gaps to SSEH Hardness for Globally Constrained CSPs

    On Lifting Integrality Gaps to SSEH Hardness for Globally Constrained CSPs by Ghoshal, Suprovat, Lee, Euiwoong

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  5. 5
    Approximating CSPs with Outliers

    Approximating CSPs with Outliers by Ghoshal, Suprovat, Anand, Louis

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    Exploiting Correlation to Achieve Faster Learning Rates in Low-Rank Preference Bandits

    Exploiting Correlation to Achieve Faster Learning Rates in Low-Rank Preference Bandits by Ghoshal, Suprovat, Saha, Aadirupa

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  7. 7
    A Characterization of Approximability for Biased CSPs

    A Characterization of Approximability for Biased CSPs by Ghoshal, Suprovat, Lee, Euiwoong

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    Tight Approximation Bounds for Maximum Multi-Coverage

    Tight Approximation Bounds for Maximum Multi-Coverage by Barman, Siddharth, Omar, Fawzi, Ghoshal, Suprovat, Gürpınar, Emirhan

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  9. 9
    Constraint Satisfaction Problems with Advice

    Constraint Satisfaction Problems with Advice by Ghoshal, Suprovat, Makarychev, Konstantin, Makarychev, Yury

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    Approximation Algorithms and Hardness for Strong Unique Games

    Approximation Algorithms and Hardness for Strong Unique Games by Ghoshal, Suprovat, Anand, Louis

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  11. 11
    Hardness of Learning DNFs using Halfspaces

    Hardness of Learning DNFs using Halfspaces by Ghoshal, Suprovat, Saket, Rishi

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    Combinatorial lower bounds for 3-query LDCs

    Combinatorial lower bounds for 3-query LDCs by Bhattacharyya, Arnab, L Sunil Chandran, Ghoshal, Suprovat

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    Approximation Algorithms for Partially Colorable Graphs

    Approximation Algorithms for Partially Colorable Graphs by Ghoshal, Suprovat, Anand, Louis, Raychaudhury, Rahul

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    A PTAS for \(\ell_0\)-Low Rank Approximation: Solving Dense CSPs over Reals

    A PTAS for \(\ell_0\)-Low Rank Approximation: Solving Dense CSPs over Reals by Cohen-Addad, Vincent, Fan, Chenglin, Ghoshal, Suprovat, Lee, Euiwoong, de Mesmay, Arnaud, Newman, Alantha, Tony Chang Wang

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    Testing Sparsity over Known and Unknown Bases

    Testing Sparsity over Known and Unknown Bases by Barman, Siddharth, Bhattacharyya, Arnab, Ghoshal, Suprovat

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    Average Bias and Polynomial Sources

    Average Bias and Polynomial Sources by Bhattacharyya, Arnab, Philips, George John, Ghoshal, Suprovat, Meka, Raghu

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    Hardness of learning noisy halfspaces using polynomial thresholds

    Hardness of learning noisy halfspaces using polynomial thresholds by Bhattacharyya, Arnab, Ghoshal, Suprovat, Saket, Rishi

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH

    Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH by Bhattacharyya, Arnab, Ghoshal, Suprovat, Karthik, C S, Pasin Manurangsi

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    Parameterized Intractability of Even Set and Shortest Vector Problem

    Parameterized Intractability of Even Set and Shortest Vector Problem by Bhattacharyya, Arnab, Bonnet, Édouard, Egri, László, Ghoshal, Suprovat, Karthik, C S, Lin, Bingkai, Pasin Manurangsi, Marx, Dániel

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    On the hardness of learning sparse parities

    On the hardness of learning sparse parities by Bhattacharyya, Arnab, Gadekar, Ameet, Ghoshal, Suprovat, Saket, Rishi

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: