1 – 2 of 2
      - show: 10
 - |
 - sort: year (new to old)
 
        Close
        
            
    
    Embed this list
<iframe src=""
              width=""
              height=""
              allowtransparency="true"
              frameborder="0">
            </iframe>
        - 2020
 - 
                        Mark
        Exponential resolution lower bounds for weak pigeonhole principle and perfect matching formulas over sparse graphs
    (2020) 35th Computational Complexity Conference, CCC 2020 In Leibniz International Proceedings in Informatics, LIPIcs 169.
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
 
 - 2019
 - 
                        Mark
        A faster hafnian formula for complex matrices and its benchmarking on a supercomputer
    
    
- Contribution to journal › Article
 
 
