scientific article; zbMATH DE number 1088195

MaRDI QIDQ4364508zbMATH OpenFDO

Authors Bernd Borchert, Frank Stephan

Publication date 13 August 1998

zbMATH Keywords

absolute counting problemsBoolean circuitsBoolean functionsgap counting problemsrelative counting problemsRice's theoremUP-hard problems

Mathematics Subject Classification ID

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

Recommendations

• Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory
• scientific article; zbMATH DE number 1222577
• A second step towards complexity-theoretic analogs of Rice's Theorem

Cited in

(5)

• A second step towards complexity-theoretic analogs of Rice's Theorem
• More intensional versions of Rice's theorem
• Transformations into normal forms for quantified circuits
• scientific article; zbMATH DE number 1222577 (Why is no real title available?)
• Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4364508)