scientific article; zbMATH DE number 2186831
From MaRDI portal
Publication:3023944
zbMATH Open1104.68540MaRDI QIDQ3023944FDOQ3023944
Publication date: 7 July 2005
Full work available at URL: http://webdoc.sub.gwdg.de/diss/2003/homeister/index.html
Title of this publication is not available (Why is that?)
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
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)
Cited In (5)
- Linear codes are hard for oblivious read-once parity branching programs
- Fractional pebbling and thrifty branching programs
- Characterization and Lower Bounds for Branching Program Size Using Projective Dimension.
- Lower bounds for restricted read-once parity branching programs
- 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 Q3023944)
