Intelligent Systems.
Theory and Applications

(Intellektual'nye Sistemy. Teoriya i Prilozheniya)

An algorithm for checking the minimality of the weight of a bijunctive function that does not have affine implicits

Abstract

This paper addresses the problem of verifying the weight minimality of a bijunctive function that depends essentially on all its variables and has no affine implicits. A polynomial-time algorithm is presented for solving this problem in the case of a minimal 2-CNF.

Keywords: bijunctive function, essential variable, affine implicant, minimal 2-CNF.

BibTeX
@article{IS-Tarannikov-Trubitsin2026,
  author  = {Tarannikov, Yuri Valeryevich and Trubitsin, Nikita Mikhailovich},
  title   = {{An algorithm for checking the minimality of the weight of a bijunctive function that does not have affine implicits}},
  journal = {Intelligent Systems. Theory and Applications},
  year    = {2026},
  volume  = {30},
  number  = {4},
  pages   = {196--199},
}
AMSBIB
\Bibitem{IS-Tarannikov-Trubitsin2026}
\by Y.\,V.~Tarannikov, N.\,M.~Trubitsin
\paper An algorithm for checking the minimality of the weight of a bijunctive function that does not have affine implicits
\jour Intelligent Systems. Theory and Applications
\yr 2026
\vol 30
\issue 4
\pages 196--199
\lang In Russian
Published under Creative Commons Attribution 4.0 International (CC BY 4.0)

← Back to issue

× Issue cover