Dima Grigoriev Complexity of Positivstellensatz proofs for the knapsack. [Citation Graph (0, 0)][DBLP] Computational Complexity, 2001, v:10, n:2, pp:139-154 [Journal]
Martin Sauerhoff On the size of randomized OBDDs and read-once branching programs for k-stable functions. [Citation Graph (0, 0)][DBLP] Computational Complexity, 2001, v:10, n:2, pp:155-178 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP