Pages that link to "Item:Q1230508"
From MaRDI portal
The following pages link to Storage requirements for deterministic polynomial time recognizable languages (Q1230508):
Displayed 14 items.
- Characterizations and computational complexity of systolic trellis automata (Q792091) (← links)
- Universal algebra and hardness results for constraint satisfaction problems (Q1014634) (← links)
- Min Cut is NP-complete for edge weighted trees (Q1111019) (← links)
- White pebbles help (Q1111025) (← links)
- On iterative and cellular tree arrays (Q1124336) (← links)
- The space complexity of pebble games on trees (Q1147515) (← links)
- A comparison of two variations of a pebble game on graphs (Q1149448) (← links)
- Pebble games for studying storage sharing (Q1162159) (← links)
- On the power of white pebbles (Q1180416) (← links)
- Branching Programs for Tree Evaluation (Q3182923) (← links)
- An Application of Generalized Tree Pebbling to Sparse Matrix Factorization (Q3773170) (← links)
- Cumulative Space in Black-White Pebbling and Resolution (Q4638091) (← links)
- (Q5121903) (← links)
- Space characterizations of complexity measures and size-space trade-offs in propositional proof systems (Q6168323) (← links)