Sciweavers

1686 search results - page 17 / 338
» Programs as polygraphs: computability and complexity
Sort
View
JSC
2007
106views more  JSC 2007»
14 years 9 months ago
Computing multihomogeneous resultants using straight-line programs
We present a new algorithm for the computation of resultants associated with multihomogeneous (and, in particular, homogeneous) polynomial equation systems using straight-line pro...
Gabriela Jeronimo, Juan Sabia
ECBS
1999
IEEE
112views Hardware» more  ECBS 1999»
15 years 1 months ago
Metaprogrammable Toolkit for Model-Integrated Computing
Model-Integrated Computing, specifically Model-Integrated Program Synthesis (MIPS) environments that include visual model building, constraint management, and automatic program sy...
Ákos Lédeczi, Miklos Maroti, Gabor K...
ICFP
2007
ACM
15 years 9 months ago
Relating complexity and precision in control flow analysis
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
David Van Horn, Harry G. Mairson
CORR
2010
Springer
155views Education» more  CORR 2010»
14 years 4 months ago
A Complexity View of Markets with Social Influence
: In this paper, inspired by the work of Megiddo on the formation of preferences and strategic analysis, we consider an early market model studied in the field of economic theory, ...
Xi Chen, Shang-Hua Teng
DAGSTUHL
2006
14 years 11 months ago
On Complexity of Optimized Crossover for Binary Representations
We consider the computational complexity of producing the best possible offspring in a crossover, given two solutions of the parents. The crossover operators are studied on the cla...
Anton V. Eremeev