Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by K.N. Pankov
Recursion Formulas for the Number of (N,m, AO-resilient and Correlation-Immune Boolean Mappings
Prikladnaya diskretnaya matematika. Prilozhenie
Related publications
Backdoor Sets of Quantified Boolean Formulas
Journal of Automated Reasoning
Computational Theory
Software
Artificial Intelligence
Mathematics
Deterministic Half Automata and Boolean Mappings
Journal of Computer Science Technology Updates
Formulas Resilient to Short-Circuit Errors
Propositional PSPACE Reasoning With Boolean Programs Versus Quantified Boolean Formulas
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
The Number of M-Ary Search Trees on N Keys
Combinatorics Probability and Computing
Statistics
Probability
Applied Mathematics
Mathematics
Computational Theory
Theoretical Computer Science
New Ergodic Convergence Theorems for Non-Expansive Mappings and M-Accretive Mappings
Journal of Inequalities and Applications
Combinatorics
Applied Mathematics
Analysis
Discrete Mathematics
On the Lefschetz Number for Iterates of Continuous Mappings
Proceedings of the American Mathematical Society
Mathematics
Applied Mathematics
Recursion-Transform Method to a Non-Regular M×n Cobweb With an Arbitrary Longitude
Scientific Reports
Multidisciplinary
On (J, M, M)-Extensions of Boolean Algebras
Pacific Journal of Mathematics
Mathematics
