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
Ryan O'Donnell, Rocco A. Servedio, “Learning Monotone Decision Trees in Polynomial Time”, SIAM J. Comput., 37, no. 3, 2007, 827
Beate Bollig, 2607, STACS 2003, 2003, 295
Detlef Sieling, “Lower Bounds for Linearly Transformed OBDDs and FBDDs”, Journal of Computer and System Sciences, 64, no. 2, 2002, 419
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
D. Sieling, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings., 2003, 84
Arkadev Chattopadhyay, Yogesh Dahiya, Nikhil S. Mande, Jaikumar Radhakrishnan, Swagato Sanyal, Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023, 867
R. O'Donnell, R.A. Servedio, 21st Annual IEEE Conference on Computational Complexity (CCC'06), 2006, 213
Stasys Jukna, Georg Schnitger, “Yet harder knapsack problems”, Theoretical Computer Science, 412, no. 45, 2011, 6351
Petr Savický, Detlef Sieling, “A hierarchy result for read-once branching programs with restricted parity nondeterminism”, Theoretical Computer Science, 340, no. 3, 2005, 594