Sciweavers

264 search results - page 14 / 53
» Decomposing Algebraic Varieties
Sort
View
ISSAC
2005
Springer
105views Mathematics» more  ISSAC 2005»
14 years 2 months ago
Lifting techniques for triangular decompositions
We present lifting techniques for triangular decompositions of zero-dimensional varieties, that extend the range of the previous methods. We discuss complexity aspects, and report...
Xavier Dahan, Marc Moreno Maza, Éric Schost...
ECBS
2005
IEEE
160views Hardware» more  ECBS 2005»
14 years 2 months ago
Building Compilers by Combining Algebras
Embedded systems present a wide variety of challenges for developers of language tools. Verification of correctness, flexibility for adding new language features, and retargetin...
Garrin Kimmell, Ed Komp, Perry Alexander
WG
2004
Springer
14 years 2 months ago
Unhooking Circulant Graphs: A Combinatorial Method for Counting Spanning Trees and Other Parameters
It has long been known that the number of spanning trees in circulant graphs with fixed jumps and n nodes satisfies a recurrence relation in n. The proof of this fact was algebra...
Mordecai J. Golin, Yiu-Cho Leung
GECCO
2008
Springer
110views Optimization» more  GECCO 2008»
13 years 9 months ago
Genetic programming for finite algebras
We describe the application of genetic programming (GP) to a problem in pure mathematics, in the study of finite algebras. We document the production of human-competitive results...
Lee Spector, David M. Clark, Ian Lindsay, Bradford...
CAP
2010
13 years 3 months ago
A quantitative study of reductions in algebraic libraries
How much of existing computer algebra libraries is amenable to automatic parallelization? This is a difficult topic, yet of practical importance in the era of commodity multicore ...
Yue Li, Gabriel Dos Reis