Are lower bounds easier over the reals?
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On Implications between P-NP-Hypotheses: Decision versus Computation in Algebraic Complexity
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Distributed Algorithmic Mechanism Design and Algebraic Communication Complexity
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
| Hi-index | 0.00 |