3454 search results - page 110 / 691 » Modern computer algebra |
186
click to vote
LICS
2010
IEEE
15 years 4 months ago
2010
IEEE
The universal-algebraic approach has proved a powerful tool in the study of the computational complexity of constraint satisfaction problems (CSPs). This approach has previously b...
167
click to vote
ASIACRYPT
2004
Springer
15 years 11 months ago
2004
Springer
The “XL-algorithm” is a computational method to solve overdetermined systems of polynomial equations which is based on a generalization of the well-known method of linearizatio...
173
click to vote
ECAI
1998
Springer
15 years 10 months ago
1998
Springer
We propose a computational model for analogy solving based on a topological formalism of representation. The source and the target analogs are represented as simplexes and the anal...
148
click to vote
AB
2007
Springer
15 years 10 months ago
2007
Springer
Lie group theory states that knowledge of a m-parameters solvable group of symmetries of a system of ordinary differential equations allows to reduce by m the number of equations. ...
142
click to vote
AAECC
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. The paper deals with the question of recognizing the mutual positions of the connected components of a non-singular real projective surface S in the real projective 3-spa...