scientific article; zbMATH DE number 4204283

MaRDI QIDQ3352967zbMATH OpenFDO

Authors Stasys Jukna

Publication date 1989

zbMATH Keywords

contact scheme complexity of Boolean functionslower boundsnull-chainsprime implicants

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 4068270
• On a model of plane contact schemes
• scientific article; zbMATH DE number 4189653
• scientific article; zbMATH DE number 23021
• Entropy of contact circuits and lower bounds on their complexity

Cited in

(9)

• A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs
• Exponential space complexity for OBDD-based reachability analysis
• scientific article; zbMATH DE number 4068270 (Why is no real title available?)
• scientific article; zbMATH DE number 3637738 (Why is no real title available?)
• scientific article; zbMATH DE number 609920 (Why is no real title available?)
• A note on read-k times branching programs
• scientific article; zbMATH DE number 7250155 (Why is no real title available?)
• On BPP versus \(NP\cup coNP\) for ordered read-once branching programs
• On the size of (generalized) OBDDs for threshold 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 Q3352967)