scientific article; zbMATH DE number 17536

MaRDI QIDQ3974860zbMATH OpenFDO

Authors Carsten Damm, Christoph Meinel

Publication date 26 June 1992

zbMATH Keywords

separationtree structured \(\Omega\)-boundary programs

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3976336
• On the parity complexity measures of Boolean functions
• Separating decision tree complexity from subcube partition complexity
• The complexity of problems on probabilistic, nondeterministic, and alternating decision trees
• Complexity measures and decision tree complexity: a survey.

Cited in

(5)

• Separating $\oplus L$ from $L, NL,$ co-$NL$, and $AL = P$ for oblivious Turing machines of linear access
• Problems complete for \(\oplus L\)
• scientific article; zbMATH DE number 3976336 (Why is no real title available?)
• Separating decision tree complexity from subcube partition complexity
• Separation of complexity classes in Koiran's weak model

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