557 search results - page 2 / 112 » A Type-Coercion Problem in Computer Algebra |
GC
2011
Springer
12 years 9 months ago
2011
Springer
Given an algebraic hypersurface O in Êd, how many simplices are necessary for a simplicial complex isotopic to O? We address this problem and the variant where all vertices of the...
SIAMCOMP
2000
13 years 6 months ago
2000
In this paper we consider the complexity of several problems involving finite algebraic structures. Given finite algebras A and B, these problems ask the following. (1) Do A and B ...
CORR
2011
Springer
13 years 1 months ago
2011
Springer
This article deals with some stochastic population protocols, motivated by theoretical aspects of distributed computing. We modelize the problem by a large urn of black and white ...
CONSTRAINTS
2010
13 years 3 months ago
2010
Abstract. Many computational problems linked to uncertainty and preference management can be expressed in terms of computing the marginal(s) of a combination of a collection of val...
JC
2000
13 years 6 months ago
2000
Deciding efficiently the emptiness of a real algebraic set defined by a single equation is a fundamental problem of computational real algebraic geometry. We propose an algorithm ...