199 search results - page 10 / 40 » Computationally and Algebraically Complex Finite Algebra Mem... |
104
click to vote
DAGSTUHL
2006
15 years 1 months ago
2006
Abstract. The Galois connection involving polymorphisms and coclones has received a lot of attention in regard to constraint satisfaction problems. However, it fails if we are inte...
COMPGEOM
2009
ACM
15 years 6 months ago
2009
ACM
We revisit the problem of computing the topology and geometry of a real algebraic plane curve. The topology is of prime interest but geometric information, such as the position of...
MICS
2010
14 years 10 months ago
2010
We revisit the problem of computing the topology and geometry of a real algebraic plane curve. The topology is of prime interest but geometric information, such as the position of...
143
click to vote
FOCS
1992
IEEE
15 years 3 months ago
1992
IEEE
We announce methods for e cient management of solvable matrix groups over nite elds. We show that solvability and nilpotence can be tested in polynomial-time. Such e ciency seems ...
GECCO
2009
Springer
15 years 6 months ago
2009
Springer
Solving complex, real-world problems with genetic programming (GP) can require extensive computing resources. However, the highly parallel nature of GP facilitates using a large n...