scientific article; zbMATH DE number 3987204

zbMATH Open0609.94018MaRDI QIDQ3751515FDOQ3751515

Authors: Stasys Jukna 

Publication date: 1986

Title of this publication is not available (Why is that?)

Recommendations

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

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)

Cited In (9)

• Lower bounds for depth-restricted branching programs
• Title not available (Why is that?)
• Entropy of contact circuits and lower bounds on their complexity
• Separating $\oplus L$ from $L, NL,$ co-$NL$, and $AL = P$ for oblivious Turing machines of linear access
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Input locality and hardness amplification
• Local complexity of 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 Q3751515)