Sciweavers

923 search results - page 22 / 185
» On a generalization of Stickelberger's Theorem
Sort
View
ICFP
2012
ACM
11 years 9 months ago
Proof-producing synthesis of ML from higher-order logic
The higher-order logic found in proof assistants such as Coq and various HOL systems provides a convenient setting for the development and verification of pure functional program...
Magnus O. Myreen, Scott Owens
ENTCS
2002
136views more  ENTCS 2002»
13 years 6 months ago
Final Coalgebras And a Solution Theorem for Arbitrary Endofunctors
Every endofunctor F of Set has an initial algebra and a final coalgebra, but they are classes in general. Consequently, the endofunctor F of the category of classes that F induces...
Jirí Adámek, Stefan Milius, Jiri Vel...
GECCO
2000
Springer
113views Optimization» more  GECCO 2000»
13 years 10 months ago
A Non-Linear Schema Theorem for Genetic Algorithms
We generalize Holland's Schema Theorem to the setting that genes are arranged, not necessarily in a linear sequence, but as the nodes in a connected graph. We have experiment...
William A. Greene
CORR
2008
Springer
58views Education» more  CORR 2008»
13 years 6 months ago
On Ritt's decomposition Theorem in the case of finite fields
11 A classical theorem by Ritt states that all the complete decomposition chains of a univariate polynomial satisfying a certain tameness condition have the same length. In this p...
Jaime Gutierrez, David Sevilla
CORR
2008
Springer
96views Education» more  CORR 2008»
13 years 6 months ago
A Sparse Flat Extension Theorem for Moment Matrices
In this note we prove a generalization of the flat extension theorem of Curto and Fialkow [4] for truncated moment matrices. It applies to moment matrices indexed by an arbitrary s...
Monique Laurent, Bernard Mourrain