1. Miklós Ajtai. 2005. Miklós Ajtai. 2005.
2. A Non-linear Time Lower Bound for Boolean Branching Programs. Theory of Computing 1 8 (2005) 149–176. DOI:https:// A Non-linear Time Lower Bound for Boolean Branching Programs. Theory of Computing 1 8 (2005) 149–176. DOI:https://
3. Sanjeev Arora and Boaz Barak. 2009. Sanjeev Arora and Boaz Barak. 2009.
4. Computational Complexity - A Modern Approach. Cambridge University Press. http://www.cambridge.org/catalogue/ catalogue.asp?isbn=9780521424264 Computational Complexity - A Modern Approach. Cambridge University Press. http://www.cambridge.org/catalogue/ catalogue.asp?isbn=9780521424264
5. Space–Time Tradeoffs for Subset Sum: An Improved Worst Case Algorithm