On the readability of monotone Boolean formulae

Golumbic et al. (Discrete Appl. Math. 154:1465–1477, 2006 ) defined the readability of a monotone Boolean function f to be the minimum integer k such that there exists an ∧ − ∨ -formula equivalent to f in which each variable appears at most k times. They asked whether there exists a polynomial-time...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of combinatorial optimization Ročník 22; číslo 3; s. 293 - 304
Hlavní autori:	Elbassioni, Khaled, Makino, Kazuhisa, Rauf, Imran
Médium:	Journal Article Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	Boston Springer US 01.10.2011 Springer Science + Business Media Springer
Predmet:	Applied sciences Combinatorics Computer science; control theory; systems Convex and Discrete Geometry Exact sciences and technology Logical, boolean and switching functions Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Theoretical computing Theory of Computation Complexity of monotone Boolean functions Readability Read-once functions Monotone Boolean functions Logarithmic function Boolean function Factorization Legibility Polynomial time Monotone Boolean function Upper bound Boolean logic Disjunctive form NP hard problem Conjunctive normal form
ISSN:	1382-6905, 1573-2886
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!