𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Complexity Results for Some Global Optimization Problems

✍ Scribed by M. Locatelli

Publisher
Springer
Year
2008
Tongue
English
Weight
255 KB
Volume
140
Category
Article
ISSN
0022-3239

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Boolean constraint satisfaction: complex
Boolean constraint satisfaction: complexity results for optimization problems with arbitrary weights
✍ Peter Jonsson πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 125 KB

A boolean constraint satisfaction problem consists of some ΓΏnite set of constraints (i.e., functions from 0=1-vectors to {0; 1}) and an instance of such a problem is a set of constraints applied to speciΓΏed subsets of n boolean variables. The goal is to ΓΏnd an assignment to the variables which satis

Some Complexity Results for Polynomial I
Some Complexity Results for Polynomial Ideals
✍ Ernst W. Mayr πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 184 KB

In this paper, we survey some of our new results on the complexity of a number of problems related to polynomial ideals. We consider multivariate polynomials over some ring, like the integers or the rationals. For instance, a polynomial ideal membership problem is a (w + 1)-tuple P = ( f, g 1 , g 2