Tractability conditions for classes of CNFs and their influence on the complexity of CNF minimization
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F14%3A10285649" target="_blank" >RIV/00216208:11320/14:10285649 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Tractability conditions for classes of CNFs and their influence on the complexity of CNF minimization
Original language description
The paper describes some tractability conditions for classes of CNFs and their influence on the computational and algorithmic complexity of CNF minimization within these classes
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of Seventeenth Czech-Japan Seminar on Data Analysis & Decision Making under Uncertainty (CJS 2014)
ISBN
—
ISSN
2188-9759
e-ISSN
—
Number of pages
8
Pages from-to
—
Publisher name
The Graduate School of Information, Production and Systems, Waseda University
Place of publication
Waseda
Event location
Kitakyushu, Japan
Event date
Sep 16, 2014
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—