Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication

Beate Bollig. Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication. Electronic Colloquium on Computational Complexity (ECCC), 7(48), 2000. [doi]

@article{ECCC-TR00-048,
  title = {Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication},
  author = {Beate Bollig},
  year = {2000},
  url = {http://eccc.hpi-web.de/eccc-reports/2000/TR00-048/index.html},
  researchr = {https://researchr.org/publication/ECCC-TR00-048},
  cites = {0},
  citedby = {0},
  journal = {Electronic Colloquium on Computational Complexity (ECCC)},
  volume = {7},
  number = {48},
}