•  
    • Papers

      Select        
       
      Year: Type Investigators
       

      Recent 5


       Article    
      Glivický Petr, Kala Vítězslav
      Fermat's last theorem and Catalan's conjecture in weak exponential arithmetics
      Mathematical Logic Quarterly 63 (3-4), 2017, 162-174.


       Paper in proceedings    
      de Oliveira Oliveira Mateus, Pudlák Pavel
      Representations of monotone Boolean functions by linear programs
      in Proceedings of the 32nd Computational Complexity Conference (CCC 2017), Riga, Latvia, 6.7.2017 - 9.7.2017, editor(s): Ryan O’Donnell, 32nd Computational Complexity Conference (CCC 2017); Leibniz International Proceedings in Informatics (LIPIcs), Vol. 79, Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Dagstuhl, 2017, 1-14.


       Paper in proceedings    
      Pudlák Pavel, Thapen Neil Dillip
      Random resolution refutations
      in Proceedings of the 32nd Computational Complexity Conference (CCC 2017), Riga, Latvia, 6.7.2017 - 9.7.2017, editor(s): Ryan O’Donnell, 32nd Computational Complexity Conference (CCC 2017); Leibniz International Proceedings in Informatics (LIPIcs), Vol. 79, Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Dagstuhl, 2017, 1-10.


       Paper in proceedings    
      de Oliveira Oliveira Mateus
      Ground reachability and joinability in linear term rewriting systems are fixed parameter tractable with respect to depth
      in Proceedings of the 11th International Symposium on Parameterized and Exact Computation (IPEC 2016), Aarhus, Denmark, 24.8.2016 - 26.8.2016, editor(s): Jiong Guo and Danny Hermelin (Eds.), 11th International Symposium on Parameterized and Exact Computation (IPEC 2016), Leibniz International Proceedings in Informatics (LIPIcs), vol. 63, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, 2017, 1-12.


       Article    
      de Oliveira Oliveira Mateus
      On the satisfiability of quantum circuits of small treewidth
      Theory of Computing Systems 61 (2), 2017, 656-688.

  •