scientific article

zbMATH Open0621.68028MaRDI QIDQ3757396FDOQ3757396

Ingo Wegener

Publication date: 1987

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

zbMATH Keywords

lower boundsBoolean circuitsBoolean functionscircuit complexitybranching programsdecision tree complexity of clique functions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited In (4)

• Entropy of contact circuits and lower bounds on their complexity
• Title not available (Why is that?)
• Time-space trade-offs for branching programs
• On P versus NP\(\cap\)co-NP for decision trees and read-once branching programs

   Recommendations

• On the complexity of branching programs and decision trees for clique functions 👍 👎
• Title not available (Why is that?) 👍 👎
• A read-once lower bound and a \((1,+k)\)-hierarchy for branching programs 👍 👎
• 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 Q3757396)