Incremental branching programs
From MaRDI portal
Publication:929291
DOI10.1007/s00224-007-9049-yzbMath1141.68031OpenAlexW2107000858MaRDI QIDQ929291
Michal Koucký, Pierre McKenzie, Anna Gál
Publication date: 17 June 2008
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2006/623/
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Oracle branching programs and Logspace versus \(P^*\)
- An observation on time-storage trade off
- Complete problems for deterministic polynomial time
- Time-space tradeoffs for branching programs
- Separation of the monotone NC hierarchy
- On lower bounds for read-\(k\)-times branching programs
- Relationships between nondeterministic and deterministic tape complexities
- Incremental Branching Programs
- Space Lower Bounds for Maze Threadability on Restricted Machines
- A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation
- Space bounds for a game on graphs
- Tight Lower Bounds for st-Connectivity on the NNJAG Model
- A note on read-$k$ times branching programs
- Branching Programs and Binary Decision Diagrams
- Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
This page was built for publication: Incremental branching programs
