Article (Scientific journals)
Variable and term removal from Boolean formulae
Crama, Yves; Ekin, Oya; Hammer, Peter L.
1997In Discrete Applied Mathematics, 75, p. 217-230
Peer Reviewed verified by ORBi
 

Files


Full Text
VariableTermRemoval.pdf
Publisher postprint (942.87 kB)
Open archive Elesvier
Download

All documents in ORBi are protected by a user license.

Send to



Details



Abstract :
[en] Given a Boolean formula in disjunctive normal form, the variable deletion control set problem consists in finding a minimum cardinality set of variables whose deletion from the formula results in a DNF satisfying some prescribed property. Similar problems can be defined with respect to the fixation of variables or the deletion of terms in a DNF. In this paper, we investigate the complexity of such problems for a broad class of DNF properties.
Disciplines :
Quantitative methods in economics & management
Mathematics
Author, co-author :
Crama, Yves  ;  Université de Liège > HEC-Ecole de gestion : UER > Recherche opérationnelle et gestion de la production
Ekin, Oya
Hammer, Peter L.
Language :
English
Title :
Variable and term removal from Boolean formulae
Publication date :
1997
Journal title :
Discrete Applied Mathematics
ISSN :
0166-218X
eISSN :
1872-6771
Publisher :
Elsevier Science, Amsterdam, Netherlands
Volume :
75
Pages :
217-230
Peer reviewed :
Peer Reviewed verified by ORBi
Available on ORBi :
since 17 October 2016

Statistics


Number of views
72 (5 by ULiège)
Number of downloads
116 (0 by ULiège)

Scopus citations®
 
22
Scopus citations®
without self-citations
22
OpenCitations
 
11

Bibliography


Similar publications



Contact ORBi