scientific article; zbMATH DE number 4002123

zbMATH Open0618.05027MaRDI QIDQ3754637FDOQ3754637

Authors: Stasys Jukna 

Publication date: 1985

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

Recommendations

• Publication:3033329
• Entropy of contact circuits and lower bounds on their complexity
• scientific article; zbMATH DE number 3867233
• Stochastic Algorithms: Foundations and Applications
• Lower Bounds on Formula Size of Boolean Functions Using Hypergraph Entropy

zbMATH Keywords

Boolean functionslower bound problemconvolution of finite digraphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph theory (05C99)

Cited In (3)

• Lower Bounds on Formula Size of Boolean Functions Using Hypergraph Entropy
• Title not available (Why is that?)
• Title not available (Why is that?)

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