Descriptive complexity theory over the real numbers
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Designs, Codes and Cryptography
Randomized Ω(n2) lower bound for knapsack
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On the complexity of halfspace area queries
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Fast context-free grammar parsing requires fast boolean matrix multiplication
Journal of the ACM (JACM)
Computing Reciprocals of Bivariate Power Series
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Improvements of the Alder-Strassen Bound: Algebras with Nonzero Radical
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Algebras of Minimal Rank over Arbitrary Fields
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
A (5/2)n2-Lower Bound for the Multiplicative Complexity of n×n-Matrix Multiplication
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
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
Computer algebra handbook
Fast computation of discrete invariants associated to a differential rational mapping
Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
Fast context-free parsing requires fast Boolean matrix multiplication
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Polynomial equation solving by lifting procedures for ramified fibers
Theoretical Computer Science - Algebraic and numerical algorithm
Deformation techniques to solve generalised Pham systems
Theoretical Computer Science - Algebraic and numerical algorithm
A new algorithm to solve nonlinear systems
Advances in Engineering Software
ACM Transactions on Algorithms (TALG)
Digital hyperplane recognition in arbitrary fixed dimension within an algebraic computation model
Image and Vision Computing
Semisimple algebras of almost minimal rank over the reals
Theoretical Computer Science
A new algorithm to solve nonlinear systems
Advances in Engineering Software
On defining integers in the counting hierarchy and proving arithmetic circuit lower bounds
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Arithmetic Circuits: A survey of recent results and open questions
Foundations and Trends® in Theoretical Computer Science
Complexity analysis for digital hyperplane recognition in arbitrary fixed dimension
DGCI'05 Proceedings of the 12th international conference on Discrete Geometry for Computer Imagery
Efficient evaluation of specific queries in constraint databases
Information Processing Letters
Semisimple algebras of almost minimal rank over the reals
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Hi-index | 0.00 |