11151 search results - page 33 / 2231 » On the Complexity of Model Expansion |
COCOA
2011
Springer
12 years 7 months ago
2011
Springer
The work in this paper is to initiate a theory of testing monomials in multivariate polynomials. The central question is to ask whether a polynomial represented by certain economi...
ISSAC
1989
Springer
13 years 11 months ago
1989
Springer
The use of lookup tables can reduce the complexity of calculation of functions defined typically by mathematical recurrence relations. Although this technique has been adopted by...
JOS
2011
13 years 2 months ago
2011
LATA
2012
Springer
12 years 3 months ago
2012
Springer
We investigate the application of Courcelle’s Theorem and the logspace version of Elberfeld et al. in the context of the implication problem for propositional sets of formulae, t...
ECCC
2007
13 years 7 months ago
2007
We study graph properties which are testable for bounded degree graphs in time independent of the input size. Our goal is to distinguish between graphs having a predetermined grap...