Lics

IEEE Symposium on Logic in Computer Science

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

Thirty first Annual IEEE Symposium on

Logic in Computer Science (LICS 2016)

Paper: Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps (at LICS 2016)

Authors: Christoph Berkholz Jakob Nordström

Abstract

No Abstract Available

BibTeX

  @InProceedings{Nordstrm-NearOptimalLowerBou,
    author = 	 {Christoph Berkholz and Jakob Nordström},
    title = 	 {Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps},
    booktitle =  {Proceedings of the Thirty first Annual IEEE Symposium on Logic in Computer Science (LICS 2016)},
    year =	 {2016},
    month =	 {July}, 
    pages =      {267--276},
    location =   {New York City}, 
    publisher =	 {IEEE Computer Society Press}
  }
   

Last modified: 2017-04-0512:37
Andrzej Murawski