On the Complexity of Integer Programming in the Blum-Shub-Smale Computational Model
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Exotic quantifiers, complexity classes, and complete problems
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Hi-index | 5.23 |