Proceedings 28-th IEEE Conference on Computational Complexityсборник

Статьи, опубликованные в сборнике

---

• 
  • 2013 Short lists with short programs in short time
  • Bauwens Bruno, Makhlin Anton, Vereshchagin Nikolay, Zimand Marius
  • в сборнике Proceedings 28-th IEEE Conference on Computational Complexity, место издания Stanford, CA, с. 98-108 DOI
• 
  • 2013 Towards a reverse Newman's theorem in interactive information complexity
  • Brody Joshua, Buhrman Harry, Koucky Michal, Loff Bruno, Speelman Florian, Vereshchagin Nikolay
  • в сборнике Proceedings 28-th IEEE Conference on Computational Complexity, место издания Stanford, CA, с. 24-33 DOI