A subclass of Horn CNFs optimally compressible in polynomial time
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F10%3A10057308" target="_blank" >RIV/00216208:11320/10:10057308 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
A subclass of Horn CNFs optimally compressible in polynomial time
Original language description
We define a new class of Horn functions properly containing both of known polynomial classes and design a polynomial time HM algorithm for this new class.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach
Others
Publication year
2010
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
Name of the periodical
Annals of Mathematics and Artificial Intelligence
ISSN
1012-2443
e-ISSN
—
Volume of the periodical
2009
Issue of the periodical within the volume
3-4
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
43
Pages from-to
—
UT code for WoS article
000280226500003
EID of the result in the Scopus database
—