Lupanov's (k, s)-representation, named after Oleg Lupanov, is a means of representing Boolean circuits to demonstrate an asymptotically tight upper bound...

circuit complexity as the hardest function. O. B. Lupanov is best known for his (k, s)-Lupanov representation of Boolean functions that he used to devise an...

Logical equality Logical implication Logical negation Logical NOR Lupanov representation Majority function Material conditional Minimal axioms for Boolean...

computational complexity) Oleg Lupanov, coined the term "Shannon effect"; developed the (k, s)-Lupanov representation of Boolean functions Yuri Matiyasevich...

committees), the dean of the MSU Faculty of Mechanics and Mathematics Oleg Lupanov, as well as professor and senior examiner Alexander Mishchenko as the main...

This is the subset construction by Rabin and Scott, proved optimal by Lupanov. UFA to DFA: 2 n {\displaystyle 2^{n}} states, see Leung, An earlier lower...