scientific article; zbMATH DE number 4094807

MaRDI QIDQ3821577zbMATH OpenFDO

Authors Ingo Wegener

Publication date 1988

zbMATH Keywords

Boolean functionbound-depth circuitsparallel complexityparallel computationsprime implicants

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of graph theory to circuits and networks (94C15)

Recommendations

• scientific article; zbMATH DE number 3922536
• Bounded-depth, polynomial-size circuits for symmetric functions
• The complexity of the parity function in unbounded fan-in, unbounded depth circuits
• scientific article; zbMATH DE number 4035741
• scientific article; zbMATH DE number 4012495

Cited in

(7)

• Subset sum ``cubes and the complexity of primality testing
• Computing prime implicates by pruning the search space and accelerating subsumption
• scientific article; zbMATH DE number 3922536 (Why is no real title available?)
• Computing prime implicants via transversal clauses
• scientific article; zbMATH DE number 856969 (Why is no real title available?)
• Connected Boolean functions with a locally extremal number of prime implicants
• Properties of Boolean functions with the extremal number of prime implicants

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