A New Rank Technique for Formula Size Lower Bounds

Troy Lee. A New Rank Technique for Formula Size Lower Bounds. In Wolfgang Thomas, Pascal Weil, editors, STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings. Volume 4393 of Lecture Notes in Computer Science, pages 145-156, Springer, 2007. [doi]

@inproceedings{Lee07:43,
  title = {A New Rank Technique for Formula Size Lower Bounds},
  author = {Troy Lee},
  year = {2007},
  doi = {10.1007/978-3-540-70918-3_13},
  url = {http://dx.doi.org/10.1007/978-3-540-70918-3_13},
  researchr = {https://researchr.org/publication/Lee07%3A43},
  cites = {0},
  citedby = {0},
  pages = {145-156},
  booktitle = {STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings},
  editor = {Wolfgang Thomas and Pascal Weil},
  volume = {4393},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-540-70917-6},
}