Sciweavers

81
Voted
CPC
1998
91views more  CPC 1998»
14 years 10 months ago
Complexity and Probability of Some Boolean Formulas
For any Boolean functionf letL(f) be its formulasizecomplexityin the basis f^ 1g. For every n and every k n=2, we describe a probabilistic distribution on formulas in the basis f^...
Petr Savický