484 search results - page 46 / 97 » Computing Hilbert Class Polynomials |
CIE
2010
Springer
14 years 1 months ago
2010
Springer
In this note, we use lower bounds on Boolean multiplicative complexity to prove lower bounds on Boolean circuit complexity. We give a very simple proof of a 7n/3 − c lower bound ...
ERSHOV
2006
Springer
14 years 13 days ago
2006
Springer
Abstract. We define the first nontrivial polynomially recognizable subclass of P-matrix Generalized Linear Complementarity Problems (GLCPs) with a subexponential pivot rule. No suc...
EUROGRAPHICS
2010
Eurographics
14 years 3 months ago
2010
Eurographics
Higher-order finite element methods have emerged as an important discretization scheme for simulation. They are increasingly used in contemporary numerical solvers, generating a ...
ICDT
2009
ACM
14 years 9 months ago
2009
ACM
The class of unions of conjunctive queries (UCQ) has been shown to be particularly well-behaved for data exchange; its certain answers can be computed in polynomial time (in terms...
COLT
1993
Springer
14 years 26 days ago
1993
Springer
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...