scientific article; zbMATH DE number 3622921
From MaRDI portal
Publication:4185781
zbMath0401.68002MaRDI QIDQ4185781
No author found.
Publication date: 1976
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Space-time tradeoffs for linear recursion, Static-memory-hard functions, and modeling the cost of space vs. time, Derivation of efficient programs for computing sequences of actions, Cumulative Space in Black-White Pebbling and Resolution, A note about \(k\)-DNF resolution, Branching Programs for Tree Evaluation, Some relationships between logics of programs and complexity theory, White pebbles help, On the structural simplicity of machines and languages, Recursion versus tail recursion over \(\overline{\mathbb{F}}_p\), Program schemes, recursion schemes, and formal languages, Extending the Hong-Kung model to memory hierarchies, Time-space tradeoffs for computing functions, using connectivity properties of their circuits, Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential Attacks, The equivalence of r.e. program schemes and data flow schemes, The parallel reversible pebbling game: analyzing the post-quantum security of iMHFs, The size and depth of layered Boolean circuits, Pebbling with an auxiliary pushdown, Pebble games for studying storage sharing, Optimal off-line detection of repetitions in a string, Extreme time-space tradeoffs for graphs with small space requirements, Incremental branching programs, On the cost of recomputing: tight bounds on pebbling with faults, On the expressive power of finitely typed and universally polymorphic recursive procedures, A difference in complexity between recursion and tail recursion, An observation on time-storage trade off, Space bounds for a game on graphs, Storage requirements for deterministic polynomial time recognizable languages, Completeness results for the equivalence of recursive schemas, A family of rules for recursion removal, Relationships between classes of monotonic functions, Effective proper procedures and universal classes of program schemata, Reversible pebble games and the relation between tree-like and general resolution space, Nullstellensatz size-degree trade-offs from reversible pebbling, Time-space trade-offs in a pebble game, Expressive power of typed and type-free programming languages, On abstraction and the expressive power of programming languages, Translating recursion equations into flow charts, Recursive information transducers: Computation models, On the cost of recomputing: Tight bounds on pebbling with faults, Characterization of flowchartable recursions, Bandwidth and pebbling, Nullstellensatz size-degree trade-offs from reversible pebbling, Translatability of schemas over restricted interpretations, A view of computability on term algebras, Size-space tradeoffs for oblivious computations, Necessary and sufficient conditions for the universality of programming formalisms, Program schemes, arrays, Lindström quantifiers and zero-one laws, Counter machines, Depth-Robust Graphs and Their Cumulative Memory Complexity, Logical and schematic characterization of complexity classes
