Pavel Emelyanov

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
The complexity of AND-decomposition of Boolean functions Discrete Applied Mathematics	2020-05-18	Paper
On a polytime factorization algorithm for multilinear polynomials over \(\mathbb{F}_2\) (available as arXiv preprint)	2018-10-23	Paper
Algorithmic issues of AND-decomposition of Boolean formulas Programming and Computer Software	2016-06-27	Paper
AND-decomposition of Boolean polynomials with prescribed shared variables Algorithms and Discrete Applied Mathematics	2016-03-23	Paper
On tractability of disjoint AND-decomposition of Boolean formulas Lecture Notes in Computer Science	2015-12-03	Paper
Path reconstruction in Barning-Hall tree	2014-02-26	Paper
Using floorplans for software visualization Joint Bulletin of the Novosibirsk Computing Center (NCC) and A. P. Ershov Institute of Informatics Systems (IIS). Series: Computer Science	2012-04-13	Paper
On Hunting for Taxicab Numbers	2008-02-08	Paper
On the maximal length of a snake in hypercubes of small dimension Discrete Mathematics	2002-02-21	Paper
scientific article; zbMATH DE number 919264 (Why is no real title available?)	1997-03-09	Paper

Research outcomes over time

This page was built for person: Pavel Emelyanov