SwePub
Sök i SwePub databas

  Extended search

Träfflista för sökning "WFRF:(Khuller Samir) "

Search: WFRF:(Khuller Samir)

  • Result 1-1 of 1
Sort/group result
   
EnumerationReferenceCoverFind
1.
  • De Rezende, Susanna F., et al. (author)
  • Automating algebraic proof systems is NP-hard
  • 2021
  • In: STOC 2021 - Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. - New York, NY, USA : ACM. - 0737-8017. - 9781450380539 ; , s. 209-222
  • Conference paper (peer-reviewed)abstract
    • We show that algebraic proofs are hard to find: Given an unsatisfiable CNF formula F, it is NP-hard to find a refutation of F in the Nullstellensatz, Polynomial Calculus, or Sherali-Adams proof systems in time polynomial in the size of the shortest such refutation. Our work extends, and gives a simplified proof of, the recent breakthrough of Atserias and Müller (JACM 2020) that established an analogous result for Resolution.
  •  
Skapa referenser, mejla, bekava och länka
  • Result 1-1 of 1
Type of publication
conference paper (1)
Type of content
peer-reviewed (1)
Author/Editor
de Rezende, Susanna ... (1)
Nordström, Jakob (1)
Pitassi, Toniann (1)
Sokolov, Dmitry (1)
Göös, Mika (1)
Robere, Robert (1)
show more...
Khuller, Samir (1)
Williams, Virginia V ... (1)
show less...
University
Lund University (1)
Language
English (1)
Research subject (UKÄ/SCB)
Natural sciences (1)
Year
2021 (1)

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view