scientific article; zbMATH DE number 17817

MaRDI QIDQ3975161zbMATH OpenFDO

Authors David A. Mix Barrington, Pierre McKenzie

Publication date 26 June 1992

zbMATH Keywords

GENlower boundsoracle branching programs

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Oracle branching programs and Logspace versus \(P^*\)
• Incremental branching programs
• Polynomial size \(\Omega\)-branching programs and their computational power
• scientific article; zbMATH DE number 4051004
• Incremental Branching Programs

Cited in

(4)

• Oracle branching programs and Logspace versus \(P^*\)
• Incremental Branching Programs
• scientific article; zbMATH DE number 2038755 (Why is no real title available?)
• Incremental branching programs

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