•  
    • Papers

      Select        
       
      Year: Type Investigators
       

      Recent 5


       Article    
      Jeřábek Emil
      Proof complexity of intuitionistic implicational formulas
      Annals of Pure and Applied Logic 168 (1), 2017, 150-190.


       Article    
      Hrubeš Pavel
      On hardness of multilinearization, and VNP-completeness in characteristics 2
      ACM Transactions on Computation Theory 9 (1), 2016, 1-.


       Article    
      Bonacina Ilario, Galesi Nicola, Thapen Neil Dillip
      Total space in resolution
      SIAM Journal on Computing 45 (5), 2016, 1894-1909.


       Paper in proceedings    
      de Oliveira Oliveira Mateus
      Causality in Bounded Petri Nets is MSO Definable
      in Proceedings of the 23rd International Workshop on Logic, Information and Computation (WoLLIC 2016), Puebla, Mexico, 16.8.2016 - 19.8.2016, editor(s): Jouko Väänänen, Åsa Hirvonen, Logic, Language, Information, and Computation; Lecture Notes in Computer Science 9803, Springer, Cham, 2016, 200-214.


       Paper in proceedings    
      de Oliveira Oliveira Mateus
      Satisfiability via smooth pictures
      in Proceedings of the 19th International Conference on Theory and Applications of Satisfiability Testing (SAT 2016), Bordeaux, France, 5.7.2016 - 8.7.2016, editor(s): Nadia Creignou, Daniel Le Berre, Theory and Applications of Satisfiability Testing – SAT 2016, Lecture Notes in Computer Science, vol. 9710, Springer, Cham, 2016, 13-28.

  •