Recursion Formulas for the Number of (N,m, AO-resilient and Correlation-Immune Boolean Mappings

Prikladnaya diskretnaya matematika. Prilozhenie
doi 10.17223/2226308x/12/19
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Tomsk State University

Related search

Backdoor Sets of Quantified Boolean Formulas

Journal of Automated Reasoning
Computational TheorySoftwareArtificial IntelligenceMathematics
2008English

Deterministic Half Automata and Boolean Mappings

Journal of Computer Science Technology Updates
2015English

Formulas Resilient to Short-Circuit Errors

2012English

Propositional PSPACE Reasoning With Boolean Programs Versus Quantified Boolean Formulas

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

The Number of M-Ary Search Trees on N Keys

Combinatorics Probability and Computing
StatisticsProbabilityApplied MathematicsMathematicsComputational TheoryTheoretical Computer Science
1997English

New Ergodic Convergence Theorems for Non-Expansive Mappings and M-Accretive Mappings

Journal of Inequalities and Applications
CombinatoricsApplied MathematicsAnalysisDiscrete Mathematics
2016English

On the Lefschetz Number for Iterates of Continuous Mappings

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1976English

Recursion-Transform Method to a Non-Regular M×n Cobweb With an Arbitrary Longitude

Scientific Reports
Multidisciplinary
2015English

On (J, M, M)-Extensions of Boolean Algebras

Pacific Journal of Mathematics
Mathematics
1974English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy