Lics

IEEE Symposium on Logic in Computer Science

LICS Home - LICS Awards - LICS Newsletters - LICS Archive - LICS Organization - Logic-Related Conferences - Links

Thirtieth Annual IEEE Symposium on

Logic in Computer Science (LICS 2015)

Paper: Complexity Bounds for Sum-Product Logic via Additive Proof Nets and Petri Nets (at LICS 2015)

Authors: Willem Heijltjes Dominic J. D. Hughes

Abstract

No Abstract Available

BibTeX

  @InProceedings{HeijltjesHughes-ComplexityBoundsfor,
    author = 	 {Willem Heijltjes and Dominic J. D. Hughes},
    title = 	 {Complexity Bounds for Sum-Product Logic via Additive Proof Nets and Petri Nets},
    booktitle =  {Proceedings of the Thirtieth Annual IEEE Symposium on Logic in Computer Science (LICS 2015)},
    year =	 {2015},
    month =	 {July}, 
    pages =      {80--91},
    location =   {Kyoto, Japan}, 
    publisher =	 {IEEE Computer Society Press}
  }
   

Last modified: 2018-06-2121:59
Andrzej Murawski