On construction of the set of irreducible partial covers

Authors:
Mikhail Ju. Moshkov
Affiliations:
Foundation for Support of Agrarian Reform and Rural Development, Moscow, Russia
Venue:
SAGA'05 Proceedings of the Third international conference on StochasticAlgorithms: foundations and applications
Year:
2005

Citing 4
Cited 1

Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle

SIAM Journal on Computing
The Maximum Latency and Identification of Positive Boolean Functions

SIAM Journal on Computing
Almost all monotone Boolean functions are polynomially learnable using membership queries

Information Processing Letters
Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data

On algorithms for construction of all irreducible partial covers

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the paper a totally polynomial algorithm for construction of the set of irreducible partial covers for the major part of set cover problems is considered.