Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
S. Žaković
Claudia Calabrese
Hao Mao
Peter Malec
C.E. Moxey
Giovanni Venturelli
Matthias Boenig
Chen Ma
Radu Timofte
Kuanrui Yin
Home
/
Author
/
PAVEL G. EMELYANOV
Author Info
Open Visualization
Name
Affiliation
Papers
PAVEL G. EMELYANOV
Inst Informat Syst, 6 Prosp Acad Lavrentieva, Novosibirsk 630090, Russia
6
Collaborators
Citations
PageRank
2
12
2.48
Referers
Referees
References
16
25
23
Publications (6 rows)
Collaborators (2 rows)
Referers (16 rows)
Referees (25 rows)
Title
Citations
PageRank
Year
The complexity of AND—decomposition of Boolean functions
0
0.34
2020
On Polytime Algorithm for Factorization of Multilinear Polynomials Over F2.
0
0.34
2018
AND-Decomposition of Boolean Polynomials with Prescribed Shared Variables.
1
0.40
2016
Algorithmic issues of AND-decomposition of boolean formulas
3
0.45
2015
On Tractability Of Disjoint And-Decomposition Of Boolean Formulas
2
0.44
2014
On the maximal length of a snake in hypercubes of small dimension
6
0.52
2000
1