Time bounded random access machines
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3557235 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- scientific article; zbMATH DE number 3403734 (Why is no real title available?)
- Computational complexity of random access stored program machines
- Two-Tape Simulation of Multitape Turing Machines
Cited in
(75)- Projective plan and Möbius band obstructions
- Universal quantifiers and time complexity of random access machines
- Inexactness and a future of computing
- Elimination of local bridges
- Lower bounds to processor-time tradeoffs under bounded-speed message propagation
- Adaptively secure computation for RAM programs
- 3-party distributed ORAM from oblivious set membership
- Strong time bounds: Non-computable bounds and a hierarchy theorem
- Programmable and parallel water computing
- Dynamic random-access stored-program machine for runtime code modification
- The problem of space invariance for sequential machines
- Space measures for storage modification machines
- Deterministic simulation of a single tape turing machine by a random access machine in sub-linear time
- Linkless and flat embeddings in 3-space
- Parallel machine models: how they are and where are they going
- Parallel \(\mathcal H\)-matrix arithmetics on shared memory systems
- On the complexity of the correctness problem for non-zeroness test instruction sequences
- Notes on the complexity of sorting in abstract machines
- Imperative process algebra and models of parallel computation
- Nonexistence of program optimizers in several abstract settings
- Multiplication, division, and shift instructions in parallel random access machines
- Finding read-once resolution refutations in systems of 2CNF clauses
- A process algebra for reasoning about quantum security
- Models of quantum computation and quantum programming languages
- An application of the translational method
- Translational lemmas for DLOGTIME-uniform circuits, alternating TMs, and PRAMs
- On the generic solution to \(P(X)\cong X\) in distributive categories
- Optimal length resolution refutations of difference constraint systems
- Obstructions for the Disk and the Cylinder Embedding Extension Problems
- From Turing machines to computer viruses
- Theoretical computer science: computability, decidability and logic
- Theoretical computer science: computational complexity
- Programs=data=first-class citizens in a computational world
- Computational complexity of multitape Turing machines and random access machines
- The complexity of on-line simulations between multidimensional turing machines and random access machines
- The polynomial-time hierarchy
- A survey of state vectors
- Fast probabilistic algorithms for Hamiltonian circuits and matchings
- Secure multiparty RAM computation in constant rounds
- 2-restricted extensions of partial embeddings of graphs
- Squeezing Feasibility
- Invariance properties of RAMs and linear time
- Theorems on the time hierarchy for random access machines
- A note on almost-everywhere-complex sets and separating deterministic- time-complexity classes
- A theory of strict P-completeness
- The 2004 Benjamin Franklin medal in computer and cognitive science presented to Richard M. Karp
- Array processing machines: an abstract model
- On time hierarchies
- Sorting, linear time and the satisfiability problem
- A theory of strict P-completeness
- Unit-cost pointers versus logarithmic-cost addresses
- scientific article; zbMATH DE number 3576701 (Why is no real title available?)
- On the complexity of the closed fragment of Japaridze's provability logic
- A computation model with automatic functions and relations as primitive operations
- Dynamic interpolation search revisited
- Parallel random access machines with powerful instruction sets
- Random access machines with multi-dimensional memories
- The complexity types of computable sets
- Almost-everywhere complexity hierarchies for nondeterministic time
- On quasilinear-time complexity theory
- Improved bounds for finger search on a RAM
- Tables should be sorted (on random access machines)
- Classifying the computational complexity of problems
- Parameterized random complexity
- Upper bounds for sorting integers on random access machines
- Complexity theory of parallel time and hardware
- A linear-time algorithm for symmetric convex drawings of internally triconnected plane graphs
- A characterization of the power of vector machines
- scientific article; zbMATH DE number 3574987 (Why is no real title available?)
- A characterization of time complexity by simple loop programs
- Quantum random access stored-program machines
- Smoothing the Gap Between NP and ER
- From imperative to rule-based graph programs
- Non-deterministic structures of computation
- Polynomial size linear programs for problems in \textsc{P}
This page was built for publication: Time bounded random access machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1844708)
