Sciweavers

2430 search results - page 42 / 486
» Computing Tutte Polynomials
Sort
View
FUIN
2006
93views more  FUIN 2006»
13 years 10 months ago
Membrane Computing and Economics: Numerical P Systems
Abstract. With inspiration from the economic reality, where numbers are basic entities to work with, we propose a genuinely new kind of P systems, where numerical variables evolve,...
Gheorghe Paun, Radu A. Paun
FSTTCS
2005
Springer
14 years 3 months ago
Market Equilibrium for CES Exchange Economies: Existence, Multiplicity, and Computation
Abstract. We consider exchange economies where the traders’ preferences are expressed in terms of the extensively used constant elasticity of substitution (CES) utility functions...
Bruno Codenotti, Benton McCune, Sriram Penumatcha,...
FOCS
2007
IEEE
14 years 4 months ago
Pseudorandom Bits for Polynomials
We present a new approach to constructing pseudorandom generators that fool lowdegree polynomials over finite fields, based on the Gowers norm. Using this approach, we obtain th...
Andrej Bogdanov, Emanuele Viola
ARITH
2007
IEEE
14 years 2 months ago
Efficient polynomial L-approximations
We address the problem of computing a good floating-point-coefficient polynomial approximation to a function, with respect to the supremum norm. This is a key step in most process...
Nicolas Brisebarre, Sylvain Chevillard
CCA
2009
Springer
14 years 4 months ago
Towards the Complexity of Riemann Mappings (Extended Abstract)
d Abstract) Robert Rettinger1 Department of Mathematics and Computer Science University of Hagen, Germany Abstract. We show that under reasonable assumptions there exist Riemann ma...
Robert Rettinger