scientific article

zbMath0657.94019MaRDI QIDQ3807127

Katja Lenz, Ingo Wegener

Publication date: 1988

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

zbMATH Keywords

polynomial timeNP completeconjunctive complexitydisjunctions of quadratic monomialsminimal number of conjunctions in monotone circuits for quadratic Boolean functions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

This page was built for publication: