•  
    • Papers

      Select        
       
      Year: Type Investigators
       

      Recent 5


       Article    
      Khaniki Erfan
      New relations and separations of conjectures about incompleteness in the finite domain
      Journal of Symbolic Logic, to appear.


       Article    
      Buss Sam, Thapen Neil Dillip
      DRAT and propagation redundancy proofs without new variables
      Logical Methods in Computer Science 17 (2), 2021, 12-.


       Article    
      Pudlák Pavel
      The canonical pairs of bounded depth Frege systems
      Annals of Pure and Applied Logic 172 (2), 2021, 102892-.


       Paper in proceedings    
      Galesi Nicola, Kolodziejczyk Leszek A., Thapen Neil Dillip
      Polynomial calculus space and resolution width
      in Proceedings of the 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), Baltimore, Maryland, 9.11.2019 - 12.11.2019, editor(s): -, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), IEEE, Piscataway, 2019, 1325-1337.


       Article    
      de Oliveire Oliveira Mateus, Pudlák Pavel
      Representations of monotone Boolean functions by linear programs
      ACM Transactions on Computation Theory 11 (4), 2019, 22-.

  •