The following pages link to (Q4385524):
Displaying 50 items.
- A fast algorithm for permutation pattern matching based on alternating runs (Q300457) (← links)
- On selective unboundedness of VASS (Q355513) (← links)
- P systems with proteins on membranes characterize PSPACE (Q388151) (← links)
- Equilibria, fixed points, and complexity classes (Q458480) (← links)
- Realizability models and implicit complexity (Q534712) (← links)
- On quasilinear-time complexity theory (Q672330) (← links)
- Computability in linear algebra (Q703545) (← links)
- A formalization of multi-tape Turing machines (Q744986) (← links)
- Masking traveling beams: optical solutions for NP-complete problems, trading space for time (Q847661) (← links)
- Computing equilibria: a computational complexity perspective (Q847807) (← links)
- Membrane computing and complexity theory: A characterization of PSPACE (Q859989) (← links)
- Theory of interaction (Q896903) (← links)
- Lower bounds on the computational power of an optical model of computation (Q926521) (← links)
- The weak lambda calculus as a reasonable machine (Q930866) (← links)
- The computable kernel of abstract state machines (Q959826) (← links)
- A semantic proof of polytime soundness of light affine logic (Q987375) (← links)
- On the computational efficiency of symmetric neural networks (Q1176243) (← links)
- The alternation hierarchy for sublogarithmic space is infinite (Q1312177) (← links)
- Invariance properties of RAMs and linear time (Q1327595) (← links)
- A canonical form of vector machines (Q1383713) (← links)
- The complexity of the temporal logic with ``until'' over general linear time (Q1400578) (← links)
- On sharing, memoization, and polynomial time (Q1640979) (← links)
- Computation as social agency: what, how and who (Q1641025) (← links)
- Sorting, linear time and the satisfiability problem (Q1817067) (← links)
- Parallel beta reduction is not elementary recursive (Q1854460) (← links)
- Approximate pattern matching and transitive closure logics. (Q1874401) (← links)
- The complexity of first-order and monadic second-order logic revisited (Q1886318) (← links)
- An existential locality theorem (Q1887659) (← links)
- The intrinsic difficulty of recursive functions (Q1919986) (← links)
- Counting nondeterministic computations (Q2055958) (← links)
- Computational universality and efficiency in morphogenetic systems (Q2104142) (← links)
- Call-by-value lambda calculus as a model of computation in Coq (Q2319993) (← links)
- Tight lower bounds for query processing on streaming and external memory data (Q2373746) (← links)
- Small fast universal Turing machines (Q2508974) (← links)
- A Space Lower Bound for Acceptance by One-Way Π<sub>2</sub>-Alternating Machines (Q2720409) (← links)
- Turing Machines for Dummies (Q2891358) (← links)
- Construction of tree automata from regular expressions (Q3095043) (← links)
- Sublogarithmic $\sum _2$-space is not closed under complement and other separation results (Q3142269) (← links)
- Shrinking and Expanding Cellular Automata (Q3186482) (← links)
- Squeezing Feasibility (Q3188242) (← links)
- Anonymous Processors with Synchronous Shared Memory: Monte Carlo Algorithms (Q3300814) (← links)
- Simulations by Time-Bounded Counter Machines (Q3637243) (← links)
- Difficulties in Forcing Fairness of Polynomial Time Inductive Inference (Q3648757) (← links)
- The complexity of on-line simulations between multidimensional turing machines and random access machines (Q4013406) (← links)
- Pipelined Decomposable BSP Computers (Q4800265) (← links)
- The Communication Hierarchy of Time and Space Bounded Parallel Machines (Q4825478) (← links)
- UNWEIGHTED AND WEIGHTED HYPER-MINIMIZATION (Q4923276) (← links)
- Universality, Invariance, and the Foundations of Computational Complexity in the Light of the Quantum Computer (Q4972864) (← links)
- Neighbours on a grid (Q5054822) (← links)
- What is the Church-Turing Thesis? (Q5055286) (← links)
