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

dc.citation.epage261en_US
dc.citation.issueNumber1en_US
dc.citation.spage251en_US
dc.citation.volumeNumber188en_US
dc.contributor.authorKaraşan, O. E.en_US
dc.date.accessioned2015-07-28T11:58:54Z
dc.date.available2015-07-28T11:58:54Z
dc.date.issued2011-08en_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.description.abstractWe 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 out to be equivalent to hypergraph dualization in hypergraphs of bounded degree and hence it can be achieved in incremental polynomial time.en_US
dc.description.provenanceMade available in DSpace on 2015-07-28T11:58:54Z (GMT). No. of bitstreams: 1 10.1007-s10479-009-0637-x.pdf: 435150 bytes, checksum: 66dcda15bd5e5eddcfc23af8919a2f6e (MD5)en
dc.identifier.doi10.1007/s10479-009-0637-xen_US
dc.identifier.eissn1572-9338
dc.identifier.issn0254-5330
dc.identifier.urihttp://hdl.handle.net/11693/11822
dc.language.isoEnglishen_US
dc.publisherSpringeren_US
dc.relation.isversionofhttp://dx.doi.org/10.1007/s10479-009-0637-xen_US
dc.source.titleAnnals of Operations Researchen_US
dc.subjectBoolean functionen_US
dc.subjectDualizationen_US
dc.subjectQuadratic functionen_US
dc.subjectDegree-k functionen_US
dc.subjectPolynomial total time algorithmen_US
dc.subjectHypergraph transversalen_US
dc.titleIncremental polynomial time dualization of quadratic functions and a subclass of degree-k functionsen_US
dc.typeArticleen_US

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Incremental_polynomial_time_dualization_of_quadratic_functions_and_a_subclass_of_degree-k_functions.pdf
Size:
424.95 KB
Format:
Adobe Portable Document Format
Description:
Full printable version