ALUnif - Algorithms and Lower Bounds: A Unified Approach

  • Santhanam, Rahul (Principal Investigator)

Project Details

StatusFinished
Effective start/end date1/03/1428/02/19

Funding

  • EU government bodies: £944,071.00

Fingerprint

Explore the research topics touched on by this project. These labels are generated based on the underlying awards/grants. Together they form a unique fingerprint.
  • Satisfiability on Mixed Instances

    Chen, R. & Santhanam, R., 2016, Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science. New York, NY, USA: ACM, p. 393-402 10 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    File
  • Improved Algorithms for Sparse MAX-SAT and MAX-k-CSP

    Chen, R. & Santhanam, R., 27 Oct 2015, Theory and Applications of Satisfiability Testing -- SAT 2015. Heule, M. & Weaver, S. (eds.). Cham: Springer International Publishing, p. 33-45 13 p. (Lecture Notes in Computer Science ; vol. 9340).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    File
  • Beating Exhaustive Search for Quantified Boolean Formulas and Connections to Circuit Complexity

    Santhanam, R. & Williams, R. R., 4 Jan 2015, Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015. 978-1-61197-374-7, p. 231-241 11 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    File