A Note on Amortized Space Complexity

@article{Potechin2016ANO,
  title={A Note on Amortized Space Complexity},
  author={Aaron Potechin},
  journal={CoRR},
  year={2016},
  volume={abs/1611.06632}
}
In this note, we show that while almost all functions require exponential size branching programs to compute, for all functions f there is a branching program computing a large number of copies of f which has linear size per copy of f. We then discuss which non-monotone lower bound approaches for branching programs are ruled out by this result. 

From This Paper

Topics from this paper.
2 Citations
1 References
Similar Papers

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…