scientific article; zbMATH DE number 1142308
From MaRDI portal
Publication:4385524
Cited in
(61)- On the computational efficiency of symmetric neural networks
- The alternation hierarchy for sublogarithmic space is infinite
- Invariance properties of RAMs and linear time
- A canonical form of vector machines
- The complexity of the temporal logic with ``until over general linear time
- On sharing, memoization, and polynomial time
- Computation as social agency: what, how and who
- Sorting, linear time and the satisfiability problem
- Parallel beta reduction is not elementary recursive
- Approximate pattern matching and transitive closure logics.
- The complexity of first-order and monadic second-order logic revisited
- An existential locality theorem
- The intrinsic difficulty of recursive functions
- Counting nondeterministic computations
- Computational universality and efficiency in morphogenetic systems
- Call-by-value lambda calculus as a model of computation in Coq
- Tight lower bounds for query processing on streaming and external memory data
- Small fast universal Turing machines
- A space lower bound for acceptance by one-way _2-alternating machines
- Turing machines for dummies. Why representations do matter
- Construction of tree automata from regular expressions
- Sublogarithmic $\sum _2$-space is not closed under complement and other separation results
- Shrinking and expanding cellular automata
- Squeezing Feasibility
- Anonymous processors with synchronous shared memory: Monte Carlo algorithms
- On selective unboundedness of VASS
- Simulations by Time-Bounded Counter Machines
- Difficulties in Forcing Fairness of Polynomial Time Inductive Inference
- P systems with proteins on membranes characterize PSPACE
- The complexity of on-line simulations between multidimensional turing machines and random access machines
- Equilibria, fixed points, and complexity classes
- Pipelined Decomposable BSP Computers
- The Communication Hierarchy of Time and Space Bounded Parallel Machines
- Unweighted and weighted hyper-minimization
- Universality, invariance, and the foundations of computational complexity in the light of the quantum computer
- Neighbours on a grid
- What is the Church-Turing Thesis?
- PRAM's towards realistic parallelism: BRAM's
- Smoothing the Gap Between NP and ER
- Weak parallel machines: a new class of physically feasible parallel machine models
- Playing Savitch and cooking games
- Characterizations of periods of multi-dimensional shifts
- Logic and complexity in cognitive science
- Realizability models and implicit complexity
- Morphogenetic computing: computability and complexity results
- Imperative process algebra and models of parallel computation
- Theoretical computer science: computational complexity
- On quasilinear-time complexity theory
- Reasonable space for the -calculus, logarithmically
- Computability in linear algebra
- Simulating time with square-root space
- Work-efficient query evaluation in constant time with PRAMs
- A formalization of multi-tape Turing machines
- Masking traveling beams: optical solutions for NP-complete problems, trading space for time
- Computing equilibria: a computational complexity perspective
- Membrane computing and complexity theory: A characterization of PSPACE
- Theory of interaction
- Lower bounds on the computational power of an optical model of computation
- The weak lambda calculus as a reasonable machine
- The computable kernel of abstract state machines
- A semantic proof of polytime soundness of light affine logic
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4385524)
