Suscripción a Biblioteca: Guest
Journal of Automation and Information Sciences

Publicado 12 números por año

ISSN Imprimir: 1064-2315

ISSN En Línea: 2163-9337

SJR: 0.173 SNIP: 0.588 CiteScore™:: 2

Indexed in

The Complexity of Probabilistic Stability Analysis Procedures for Integral Boolean Programming Problems

Volumen 47, Edición 5, 2015, pp. 78-84
DOI: 10.1615/JAutomatInfScien.v47.i5.70
Get accessGet access

SINOPSIS

It is shown that for the set covering problems (which differ in one position of the constraint matrix) there are not κ-probabilistic polynomial procedures for the analysis of the stability (κ ∈ {ZPP, PR}) for κ ≠ NP.