Pages that link to "Item:Q3125953"
From MaRDI portal
The following pages link to On the complexity of restrictions of Boolean functions (Q3125953):
Displaying 23 items.
- Local restrictions from the Furst-Saxe-Sipser paper (Q519884) (← links)
- The complexity of Boolean functions in different characteristics (Q626677) (← links)
- On the computational power of Boolean decision lists (Q853647) (← links)
- On the parity complexity measures of Boolean functions (Q974756) (← links)
- On the computational complexity of some classical equivalence relations on boolean functions (Q1272598) (← links)
- On estimates on the complexity of restrictions of Boolean functions (Q1380287) (← links)
- On the complexity of balanced Boolean functions (Q1606934) (← links)
- Complexity of activity tests for partial Boolean functions (Q1820131) (← links)
- Critical properties and complexity measures of read-once Boolean functions (Q2043436) (← links)
- On a hierarchy of Boolean functions hard to compute in constant depth (Q2718887) (← links)
- On the complexity of the evaluation of transient extensions of Boolean functions (Q2909178) (← links)
- On the positive and the inversion complexity of Boolean functions (Q3142263) (← links)
- (Q3334980) (← links)
- (Q3352964) (← links)
- On the complexity of Boolean functions with small number of ones (Q3409861) (← links)
- (Q3762226) (← links)
- A complexity theory based on Boolean algebra (Q3771612) (← links)
- (Q4036699) (← links)
- Local complexity of Boolean functions (Q4443562) (← links)
- On domains completely specifying Boolean functions (Q4522725) (← links)
- On inherited properties of restricted Boolean functions (Q4809570) (← links)
- (Q5150421) (← links)
- Book review of: S. Jukna, Boolean function complexity. Advances and frontiers. (Q5890688) (← links)
