scientific article; zbMATH DE number 1072537

MaRDI QIDQ4359464zbMATH OpenFDO

Authors Kenneth W. Regan

Publication date 8 October 1997

zbMATH Keywords

Boolean functionscomputational complexity theory

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• scientific article; zbMATH DE number 176873
• scientific article; zbMATH DE number 2081114
• Polynomial languages with finite antidictionaries
• Computing Boolean functions by polynomials and threshold circuits

Cited in

(10)

• Relating polynomial time to constant depth
• Algebraic languages and polyominoes enumeration
• LWPP and WPP are not uniformly gap-definable
• Symbolic Languages and Ars Combinatoria
• Polynomial languages with finite antidictionaries
• A combinatorial property of EOL languages
• scientific article; zbMATH DE number 176873 (Why is no real title available?)
• Polynomial size test sets for commutative languages
• scientific article; zbMATH DE number 1796949 (Why is no real title available?)
• scientific article; zbMATH DE number 4121470 (Why is no real title available?)

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 Q4359464)