93 citations to 10.1007/BF01200404 (Crossref Cited-By Service)
  1. Matthias Krause, Stefan Lucks, 2010, STACS 2001, 2001, 419  crossref
  2. Maurice Jansen, Meena Mahajan, B. V. Raghavendra Rao, “Resource Trade-offs in Syntactically Multilinear Arithmetic Circuits”, comput. complex., 22, № 3, 2013, 517  crossref
  3. Srikanth Srinivasan, “Strongly Exponential Separation between Monotone VP and Monotone VNP”, ACM Trans. Comput. Theory, 12, № 4, 2020, 1  crossref
  4. Rakesh Kumar Sinha, Jayram S Thathachar, “Efficient Oblivious Branching Programs for Threshold and Mod Functions”, Journal of Computer and System Sciences, 55, № 3, 1997, 373  crossref
  5. Daniel Král’, “Polynomial-Size Binary Decision Diagrams for the Exactly Half-d-Hyperclique Problem Reading Each Input Bit Twice”, Theory Comput Syst, 45, № 1, 2009, 27  crossref
  6. P. Savický, S. Žák, 1295, Mathematical Foundations of Computer Science 1997, 1997, 478  crossref
  7. S. Jukna, “A nondeterministic space-time tradeoff for linear codes”, Information Processing Letters, 109, № 5, 2009, 286  crossref
  8. Elizaveta A. Okol'nishnikova, 1279, Fundamentals of Computation Theory, 1997, 376  crossref
  9. Petr Savický, Detlef Sieling, 1893, Mathematical Foundations of Computer Science 2000, 2000, 650  crossref
  10. Beate Bollig, “Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs”, RAIRO-Theor. Inf. Appl., 37, № 1, 2003, 51  crossref
Предыдущая
1
2
3
4
5
6
7
8
9
10
Следующая