|
Journals in DBLP
- Christer Berg, Staffan Ulfberg
Symmetric Approximation Arguments for Monotone Lower Bounds Without Sunflowers. [Citation Graph (0, 0)][DBLP] Computational Complexity, 1999, v:8, n:1, pp:1-20 [Journal]
- Ilan Kremer, Noam Nisan, Dana Ron
On Randomized One-Round Communication Complexity. [Citation Graph (0, 0)][DBLP] Computational Complexity, 1999, v:8, n:1, pp:21-49 [Journal]
- Oded Goldreich, Erez Petrank
Quantifying Knowledge Complexity. [Citation Graph (0, 0)][DBLP] Computational Complexity, 1999, v:8, n:1, pp:50-98 [Journal]
|