165 search results - page 3 / 33 » Exotic Quantifiers, Complexity Classes, and Complete Problem... |
CSL
2010
Springer
14 years 10 months ago
2010
Springer
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over fixed, finite structures B. This may be seen as a natural generalisation of th...
AISC
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. The Complete Root Classification for a univariate polynomial with symbolic coefficients is the collection of all the possible cases of its root classification, together w...
FCT
2005
Springer
15 years 3 months ago
2005
Springer
We prove completeness results for twenty-three problems in semilinear geometry. These results involve semilinear sets given by additive circuits as input data. If arbitrary real co...
MFCS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. The parameterized complexity classes of the W -hierarchy are usually defined as the problems reducible to certain natural complete problems by means of fixed-parameter ...
COCO
1989
Springer
15 years 1 months ago
1989
Springer
For a monoid G, the iterated multiplication problem is the computation of the product of n elements from G. By re ning known completeness arguments, we show that as G varies over ...