Sciweavers

43 search results - page 7 / 9
» Elementary arithmetic
Sort
View
COCO
2009
Springer
117views Algorithms» more  COCO 2009»
14 years 1 months ago
The Proof Complexity of Polynomial Identities
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
Pavel Hrubes, Iddo Tzameret
BIRTHDAY
2009
Springer
13 years 5 months ago
Some Notes on Models and Modelling
Analytical models are a fundamental tool in the development of computer-based systems of every kind: their essential purpose is to support human understanding and reasoning in deve...
Michael Jackson
SIAMCOMP
2000
76views more  SIAMCOMP 2000»
13 years 7 months ago
On Interpolation and Automatization for Frege Systems
The interpolation method has been one of the main tools for proving lower bounds for propositional proof systems. Loosely speaking, if one can prove that a particular proof system ...
Maria Luisa Bonet, Toniann Pitassi, Ran Raz
DIAGRAMS
2006
Springer
13 years 11 months ago
The Mathematics of Boundaries: A Beginning
The intuitive properties of configurations of planar non-overlapping closed curves (boundaries) are presented as a pure boundary mathematics. The mathematics, which is not incorpor...
William Bricken
GECCO
2006
Springer
218views Optimization» more  GECCO 2006»
13 years 11 months ago
Genetic programming with primitive recursion
When Genetic Programming is used to evolve arithmetic functions it often operates by composing them from a fixed collection of elementary operators and applying them to parameters...
Stefan Kahrs