scientific article; zbMATH DE number 2186831

MaRDI QIDQ3023944zbMATH OpenFDO

Authors Matthias Homeister

Publication date 7 July 2005

Full work available at URL http://webdoc.sub.gwdg.de/diss/2003/homeister/index.html

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Recommendations

• Lower bounds for restricted read-once parity branching programs
• Mathematical Foundations of Computer Science 2003
• Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication
• scientific article; zbMATH DE number 1759451
• A hierarchy result for read-once branching programs with restricted parity nondeterminism

Cited in

(7)

• Fractional pebbling and thrifty branching programs
• scientific article; zbMATH DE number 4172378 (Why is no real title available?)
• Characterization and Lower Bounds for Branching Program Size Using Projective Dimension.
• Linear codes are hard for oblivious read-once parity branching programs
• Lower bounds for restricted read-once parity branching programs
• scientific article; zbMATH DE number 5899238 (Why is no real title available?)
• Mathematical Foundations of Computer Science 2003

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