- Tanja Lange, Arne Winterhof, “Interpolation of the discrete logarithm in Fq by Boolean functions and by polynomials in several variables modulo a divisor of q−1”, Discrete Applied Mathematics, 128, no. 1, 2003, 193
![https://doi.org/10.1016/S0166-218X(02)00445-6 crossref](/refsvg/svg/crossref.svg)
- Ryan O'Donnell, Rocco A. Servedio, “Learning Monotone Decision Trees in Polynomial Time”, SIAM J. Comput., 37, no. 3, 2007, 827
![https://doi.org/10.1137/060669309 crossref](/refsvg/svg/crossref.svg)
- Beate Bollig, 2607, STACS 2003, 2003, 295
![https://doi.org/10.1007/3-540-36494-3_27 crossref](/refsvg/svg/crossref.svg)
- Detlef Sieling, “Lower Bounds for Linearly Transformed OBDDs and FBDDs”, Journal of Computer and System Sciences, 64, no. 2, 2002, 419
![https://doi.org/10.1006/jcss.2001.1818 crossref](/refsvg/svg/crossref.svg)
- Beate Bollig, “A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs”, Information Processing Letters, 86, no. 3, 2003, 143
![https://doi.org/10.1016/S0020-0190(02)00486-6 crossref](/refsvg/svg/crossref.svg)
- D. Sieling, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings., 2003, 84
![https://doi.org/10.1109/CCC.2003.1214412 crossref](/refsvg/svg/crossref.svg)
- Arkadev Chattopadhyay, Yogesh Dahiya, Nikhil S. Mande, Jaikumar Radhakrishnan, Swagato Sanyal, Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023, 867
![https://doi.org/10.1145/3564246.3585199 crossref](/refsvg/svg/crossref.svg)
- R. O'Donnell, R.A. Servedio, 21st Annual IEEE Conference on Computational Complexity (CCC'06), 2006, 213
![https://doi.org/10.1109/CCC.2006.25 crossref](/refsvg/svg/crossref.svg)
- Stasys Jukna, Georg Schnitger, “Yet harder knapsack problems”, Theoretical Computer Science, 412, no. 45, 2011, 6351
![https://doi.org/10.1016/j.tcs.2011.07.003 crossref](/refsvg/svg/crossref.svg)
- Petr Savický, Detlef Sieling, “A hierarchy result for read-once branching programs with restricted parity nondeterminism”, Theoretical Computer Science, 340, no. 3, 2005, 594
![https://doi.org/10.1016/j.tcs.2005.03.016 crossref](/refsvg/svg/crossref.svg)