Incremental polynomial time dualization of quadratic functions and a subclass of degree-k functions

We consider the problem of dualizing a Boolean function f represented by a DNF. In its most general form, this problem is commonly believed not to be solvable by a quasi-polynomial total time algorithm. We show that if the input DNF is quadratic or is a special degree- k DNF, then dualization turns...

Full description

Saved in:

Bibliographic Details
Published in:	Annals of operations research Vol. 188; no. 1; pp. 251 - 261
Main Author:	Karasan, O. Ekin
Format:	Journal Article
Language:	English
Published:	Boston Springer US 01.08.2011 Springer Science + Business Media Springer Springer Nature B.V
Subjects:	Algorithms Artificial intelligence Boolean Boolean functions Business and Management Codes Combinatorics Equivalence Game theory Graphs Operations research Operations Research/Decision Theory Studies Theory of Computation Japan Polynomial total time algorithm Degree function Boolean function Hypergraph transversal Dualization Quadratic function
ISSN:	0254-5330, 1572-9338
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!