scientific article

zbMath0689.68073MaRDI QIDQ3031933

Ingo Wegener, László Zádori

Publication date: 1989

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

PRAMWRAMcombinatorial complexity measurescomplexity of a Boolen function

Mathematics Subject Classification ID

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

Related Items (4)

Sensitivity, block sensitivity, and \(\ell\)-block sensitivity of Boolean functions ⋮ Low-Sensitivity Functions from Unambiguous Certificates. ⋮ Quantum certificate complexity ⋮ Complexity measures and decision tree complexity: a survey.

This page was built for publication: