All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Boolean functions with long prime implicants

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F12%3A10126636" target="_blank" >RIV/00216208:11320/12:10126636 - isvavai.cz</a>

  • Result on the web

    <a href="http://www.cs.uic.edu/pub/Isaim2012/WebPreferences/ISAIM2012_Boolean_Cepek_etal.pdf" target="_blank" >http://www.cs.uic.edu/pub/Isaim2012/WebPreferences/ISAIM2012_Boolean_Cepek_etal.pdf</a>

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    Boolean functions with long prime implicants

  • Original language description

    In this short note we introduce a class of Boolean functions de?ned by a minimum length of its prime implicants. We show that given a DNF one can test in polynomial time whether it represents a function from this class. Moreover, in case that the answeris af?rmative we present a polynomial time algorithm which outputs a shortest DNF representation of the given function. Therefore the de?ned class of functions is a new member of a relatively small family of classes for which the Boolean minimization problem can be solved in polynomial time. Finally, we present a generalization of the above class which is still recognizable in polynomial time, and for which the Boolean minimization problem can be approximated within a constant factor.

  • Czech name

  • Czech description

Classification

  • Type

    O - Miscellaneous

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GAP202%2F10%2F1188" target="_blank" >GAP202/10/1188: KnowSched: Knowledge Techniques in Scheduling</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2012

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů