Bounds for the average-case complexity of monotone Boolean functions

2017 ◽  
Vol 27 (3) ◽  
Author(s):  
Aleksandr V. Chashkin
Keyword(s):  
Boolean Functions ◽  
Average Case ◽  
Case Complexity ◽  
Average Case Complexity ◽  
Straight Line ◽  
Monotone Boolean Functions ◽  
Straight Line Programs

AbstractWe consider average-case complexity of computing monotone Boolean functions by straight-line programs with a conditional stop over the basis of all Boolean functions of at most two variables. For the set of all

On the average-case complexity of underdetermined functions

2018 ◽  
Vol 28 (4) ◽  
pp. 201-221
Author(s):  
Aleksandr V. Chashkin
Keyword(s):  
Boolean Functions ◽  
Correct Order ◽  
Average Case ◽  
Case Complexity ◽  
Average Case Complexity ◽  
Straight Line ◽  
Straight Line Programs

Abstract The average-case complexity of computation of underdetermined functions by straight-line programs with conditional stop over the basis of all at most two-place Boolean functions is considered. Correct order estimates of the average-case complexity of functions with maximum average-case complexity among all underdetermined functions are derived depending on the degree of their determinacy, the size of their domain, and the size of their support.

The Average-Case Complexity of Determining the Majority

1997 ◽  
Vol 26 (1) ◽  
pp. 1-14 ◽  
Author(s):  
Laurent Alonso ◽  
Edward M. Reingold ◽  
René Schott
Keyword(s):  
Average Case ◽  
Case Complexity ◽  
Average Case Complexity
Sign in / Sign up

Export Citation Format

Share Document