scientific article; zbMATH DE number 3285248
From MaRDI portal
Publication:5567889
Cited in
(9)- Separating complexity classes related to -decision trees
- A sequence of complexly computable functions
- Characteristic measures of switching functions
- On complexity of standard forms for multifunctions
- Complexity of realization of Boolean functions from some classes related to finite grammars by formulas of alternation depth 3
- On the complexity of bounded-depth circuits and formulas over the basis of fan-in gates
- Constant depth formula and partial function versions of MCSP are hard
- Chair of Discrete Mathematics
- On the number of quantifiers needed to define Boolean functions
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 Q5567889)
