Lics

IEEE Symposium on Logic in Computer Science

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

Twenty-Eighth Annual IEEE Symposium on

Logic in Computer Science (LICS 2013)

Short Presentation: Feasible combinatorial matrix theory (Polytime proofs for König's Min-Max and related theorems) (at LICS 2013)

Authors: Ariel Fernández Michael Soltys

Abstract

No Abstract Available

BibTeX

  @InProceedings{FernndezSoltys-Feasiblecombinatori,
    author = 	 {Ariel Fernández and Michael Soltys},
    title = 	 {Feasible combinatorial matrix theory (Polytime proofs for König's Min-Max and related theorems)},
    booktitle =  {Proceedings of the Twenty-Eighth Annual IEEE Symposium on Logic in Computer Science (LICS 2013)},
    year =	 {2013},
    month =	 {June}, 
    location =   {New Orleans, USA}, 
    note =       {Short Presentation},
    publisher =	 {IEEE Computer Society Press}
  }
   

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