Pages that link to "Item:Q1217591"
From MaRDI portal
The following pages link to An observation on time-storage trade off (Q1217591):
Displayed 47 items.
- Upper and lower I/O bounds for pebbling \(r\)-pyramids (Q450538) (← links)
- On the complexity of typechecking top-down XML transformations (Q555775) (← links)
- Why a single parallelization strategy is not enough in knowledge bases (Q686639) (← links)
- Bandwidth constraints on problems complete for polynomial time (Q791316) (← links)
- Characterizations and computational complexity of systolic trellis automata (Q792091) (← links)
- Frontiers of tractability for typechecking simple XML transformations (Q878753) (← links)
- On the minimization of XML schemas and tree automata for unranked trees (Q882435) (← links)
- Incremental branching programs (Q929291) (← links)
- Typechecking top-down XML transformations: Fixed input or output schemas (Q937295) (← links)
- Depth-first search is inherently sequential (Q1062456) (← links)
- An introduction to parallelism in combinatorial optimization (Q1076605) (← links)
- Parallel complexity of logical query programs (Q1104095) (← links)
- A topological approach to dynamic graph connectivity (Q1108030) (← links)
- White pebbles help (Q1111025) (← links)
- Alternating multihead finite automata (Q1116353) (← links)
- On iterative and cellular tree arrays (Q1124336) (← links)
- A space efficient algorithm for the monotone planar circuit value problem (Q1133895) (← links)
- The space complexity of pebble games on trees (Q1147515) (← links)
- \(\varepsilon\)-productions in context-free grammars (Q1148693) (← links)
- A comparison of two variations of a pebble game on graphs (Q1149448) (← links)
- Pebble games for studying storage sharing (Q1162159) (← links)
- The maximum flow problem is log space complete for P (Q1165000) (← links)
- Definability by programs in first-order structures (Q1171876) (← links)
- Oracle branching programs and Logspace versus \(P^*\) (Q1183604) (← links)
- Infinitary logics and 0-1 laws (Q1193591) (← links)
- Storage requirements for deterministic polynomial time recognizable languages (Q1230508) (← links)
- A characterization of the power of vector machines (Q1232182) (← links)
- Complete problems for deterministic polynomial time (Q1235982) (← links)
- Bracket-languages are recognizable in logarithmic space (Q1235984) (← links)
- Positive versions of polynomial time (Q1281503) (← links)
- Context-sensitive transitive closure operators (Q1319508) (← links)
- Bounded arity Datalog \((\neq)\) queries on graphs (Q1376404) (← links)
- Can datalog be approximated? (Q1376415) (← links)
- On the cost of recomputing: Tight bounds on pebbling with faults (Q1575959) (← links)
- Program schemes, arrays, Lindström quantifiers and zero-one laws (Q1606129) (← links)
- Bandwidth and pebbling (Q1838912) (← links)
- Linearisability on Datalog programs (Q1884881) (← links)
- Generalized quantifiers and pebble games on finite structures (Q1892941) (← links)
- Two dynamic programming algorithms for which interpreted pebbling helps (Q2277375) (← links)
- Upper and Lower I/O Bounds for Pebbling r-Pyramids (Q3000499) (← links)
- Branching Programs for Tree Evaluation (Q3182923) (← links)
- Classifying the computational complexity of problems (Q3781088) (← links)
- (Q4146255) (← links)
- On the Average Case Complexity of Some P-complete Problems (Q4256141) (← links)
- Pebbling dynamic graphs in minimal space (Q4365023) (← links)
- Using Fifth Generation Tools for Solving the Clique Number Problem (Q4712613) (← links)
- The lexicographically first maximal subgraph problems:P-completeness andNC algorithms (Q4729355) (← links)