Average case complexity for finite Boolean functions

DOI10.1016/S0166-218X(00)00360-7zbMath1006.94034MaRDI QIDQ5954082

A. V. Chashkin

Publication date: 14 February 2003

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

Boolean functionstraight-line program complexityaverage case complexityBoolean circuit size

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)

Related Items (2)

Lower bounds for the complexity of restrictions of Boolean functions ⋮ Average time of computing Boolean operators

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: Average case complexity for finite Boolean functions