scientific article; zbMATH DE number 1088195
From MaRDI portal
Publication:4364508
zbMath0894.03020MaRDI QIDQ4364508
Publication date: 13 August 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Boolean functionsBoolean circuitsRice's theoremabsolute counting problemsgap counting problemsrelative counting problemsUP-hard problems
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)
Related Items (2)
Transformations into Normal Forms for Quantified Circuits ⋮ A second step towards complexity-theoretic analogs of Rice's Theorem
This page was built for publication: