scientific article; zbMATH DE number 3987204

<a class="pub-badge pub-badge--grey" href="https://zbmath.org/0609.94018" rel="nofollow">zbMATH</a><a class="pub-badge pub-badge--mardi" href="https://portal.mardi4nfdi.de/wiki/Item:Q3751515" rel="nofollow">MaRDI QID Q3751515</a><a class="pub-badge pub-badge--grey" href="https://fdo.portal.mardi4nfdi.de/fdo/Q3751515" rel="nofollow">FDO</a>

Authors Stasys Jukna

Publication date 1986

zbMATH Keywords

Boolean functionscomplexity of Boolean circuits

Mathematics Subject Classification ID

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

Recommendations

• Entropy of contact circuits and lower bounds on their complexity
• Publication:3033329
• Local complexity of Boolean functions
• scientific article; zbMATH DE number 4170847
• scientific article; zbMATH DE number 4061152

Cited in

(9)

• scientific article; zbMATH DE number 4068271 (Why is no real title available?)
• Separating $\oplus L$ from $L, NL,$ co-$NL$, and $AL = P$ for oblivious Turing machines of linear access
• scientific article; zbMATH DE number 4131667 (Why is no real title available?)
• scientific article; zbMATH DE number 61460 (Why is no real title available?)
• Input locality and hardness amplification
• scientific article; zbMATH DE number 697824 (Why is no real title available?)
• Local complexity of Boolean functions
• Lower bounds for depth-restricted branching programs
• Entropy of contact circuits and lower bounds on their complexity

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