467 search results - page 47 / 94 » The Complexity of Polynomials and Their Coefficient Function... |
142
click to vote
CSL
2007
Springer
15 years 6 months ago
2007
Springer
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ...
116
click to vote
CORR
2010
Springer
14 years 6 months ago
2010
Springer
: 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, ...
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract— We prove that the number of Pareto-optimal solutions in any multiobjective binary optimization problem with a finite number of linear objective functions is polynomial...
FOCS
2003
IEEE
15 years 5 months ago
2003
IEEE
We show that if an NP-complete problem has a non-adaptive self-corrector with respect to a samplable distribution then coNP is contained in NP/poly and the polynomial hierarchy co...
106
click to vote
NSF
1994
Springer
15 years 3 months ago
1994
Springer
The goal of algebraic geometry is to gain an understanding of the behaviour of functions related by polynomial relationships. Algebraic curves and surfaces having considerable adva...