English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

On the Readability of Monotone Boolean Formulae

MPS-Authors
/persons/resource/persons44374

Elbassioni,  Khaled
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45263

Rauf,  Imran
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Ressource
No external resources are shared
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Elbassioni, K., Makino, K., & Rauf, I. (2009). On the Readability of Monotone Boolean Formulae. In H. Ngo (Ed.), Computing and Combinatorics (pp. 496-505). Berlin: Springer. doi:10.1007/978-3-642-02882-3_49.


Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-189F-7
Abstract
There is no abstract available