Classes of Boolean Functions With Limited Complexity

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

Available in full text

Date
Authors
Publisher

Tomsk State University

Related search

The Monotone Circuit Complexity of Boolean Functions

Combinatorica
CombinatoricsComputational MathematicsDiscrete Mathematics
1987English

Minimizing the Average Query Complexity of Learning Monotone Boolean Functions

INFORMS Journal on Computing
Management ScienceComputer Science ApplicationsInformation SystemsOperations ResearchSoftware
2002English

About the Components of Some Classes of In-Vertible Vectorial Boolean Functions

Prikladnaya diskretnaya matematika. Prilozhenie
2019English

Cryptographic Boolean Functions With R

R Journal
UncertaintyNumerical AnalysisStatisticsProbability
2011English

The Complexity of Reasoning With Boolean Modal Logics

2002English

Counting Boolean Functions With Faster Points

Designs, Codes, and Cryptography
CombinatoricsApplied MathematicsComputer Science ApplicationsTheoretical Computer ScienceDiscrete Mathematics
2020English

Logics for Classes of Boolean Monoids

Journal of Logic, Language and Information
LinguisticsPhilosophyComputer ScienceLanguage
2004English

Separating Complexity Classes With Tally Oracles

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
1992English

Conversion From Arithmetic to Boolean Masking With Logarithmic Complexity

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy