Sciweavers

3454 search results - page 223 / 691
» Modern computer algebra
Sort
View
DAGSTUHL
2008
15 years 8 months ago
Constraint Satisfaction Problems with Infinite Templates
Allowing templates with infinite domains greatly expands the range of problems that can be formulated as a non-uniform constraint satisfaction problem. It turns out that many CSPs ...
Manuel Bodirsky
FMOODS
2003
15 years 8 months ago
Towards Object-Oriented Graphs and Grammars
This work aims to extend the algebraical approach to graph transformation to model object-oriented systems structures and computations. A graph grammar based formal framework for o...
Ana Paula Lüdtke Ferreira, Leila Ribeiro
MOC
2002
136views more  MOC 2002»
15 years 6 months ago
Automatic reduction of elliptic integrals using Carlson's relations
In a series of papers, B. C. Carlson produced tables of elliptic integrals, evaluating them in terms of easily computed symmetrical functions, using a group of multivariate recurre...
Norman Gray
SIAMCOMP
2010
174views more  SIAMCOMP 2010»
15 years 5 months ago
On the Complexity of Nash Equilibria and Other Fixed Points
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
Kousha Etessami, Mihalis Yannakakis
CAP
2010
15 years 1 months ago
Parallel operations of sparse polynomials on multicores: I. multiplication and Poisson bracket
The multiplication of the sparse multivariate polynomials using the recursive representations is revisited to take advantage on the multicore processors. We take care of the memor...
Mickaël Gastineau