10 search results - page 2 / 2 » A Constructive Proof of the Fundamental Theorem of Algebra w... |
COMBINATORICS
2006
13 years 4 months ago
2006
We associate one or two posets (which we call "semistandard posets") to any given irreducible representation of a rank two semisimple Lie algebra over C. Elsewhere we ha...
TPHOL
2003
IEEE
13 years 9 months ago
2003
IEEE
Abstract. It is well known that mathematical proofs often contain (abstract) algorithms, but although these algorithms can be understood by a human, it still takes a lot of time an...
TPHOL
2005
IEEE
13 years 10 months ago
2005
IEEE
We describe a formalization of the elementary algebra, topology and analysis of finite-dimensional Euclidean space in the HOL Light theorem prover. (Euclidean space is RN with the...
GECCO
2009
Springer
13 years 11 months ago
2009
Springer
Search spaces sampled by the process of Genetic Programming often consist of programs which can represent a function in many different ways. Thus, when the space is examined it i...
PPDP
2005
Springer
13 years 10 months ago
2005
Springer
When addressing the formal validation of generated software, two main alternatives consist either to prove the correctness of compilers or to directly validate the generated code....