Storage requirements for deterministic polynomial time recognizable languages
From MaRDI portal
Cites work
- An observation on time-storage trade off
- Characterization of flowchartable recursions
- Comparing complexity classes
- Complete Register Allocation Problems
- scientific article; zbMATH DE number 3586493 (Why is no real title available?)
- scientific article; zbMATH DE number 3622921 (Why is no real title available?)
- scientific article; zbMATH DE number 3428547 (Why is no real title available?)
- Recognition and parsing of context-free languages in time n3
Cited in
(17)- Universal algebra and hardness results for constraint satisfaction problems
- Min Cut is NP-complete for edge weighted trees
- White pebbles help
- On iterative and cellular tree arrays
- The space complexity of pebble games on trees
- A comparison of two variations of a pebble game on graphs
- Pebble games for studying storage sharing
- On the power of white pebbles
- Branching Programs for Tree Evaluation
- An Application of Generalized Tree Pebbling to Sparse Matrix Factorization
- Cumulative space in black-white pebbling and resolution
- scientific article; zbMATH DE number 7250155 (Why is no real title available?)
- Space characterizations of complexity measures and size-space trade-offs in propositional proof systems
- Pebbles and branching programs for tree evaluation
- Pebble games and algebraic proof systems
- Pebble games and algebraic proof systems
- Characterizations and computational complexity of systolic trellis automata
This page was built for publication: Storage requirements for deterministic polynomial time recognizable languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1230508)
