The complexity of Boolean formula minimization

David Buchfuhrer, Christopher Umans. The complexity of Boolean formula minimization. J. Comput. Syst. Sci., 77(1):142-153, 2011. [doi]

@article{BuchfuhrerU11,
  title = {The complexity of Boolean formula minimization},
  author = {David Buchfuhrer and Christopher Umans},
  year = {2011},
  doi = {10.1016/j.jcss.2010.06.011},
  url = {http://dx.doi.org/10.1016/j.jcss.2010.06.011},
  researchr = {https://researchr.org/publication/BuchfuhrerU11},
  cites = {0},
  citedby = {0},
  journal = {J. Comput. Syst. Sci.},
  volume = {77},
  number = {1},
  pages = {142-153},
}