The following pages link to (Q5636862):
Displaying 50 items.
- The effect of end-markers on counter machines and commutativity (Q265080) (← links)
- Reverse complexity (Q287279) (← links)
- Weak and strong one-way space complexity classes (Q293473) (← links)
- Alternating space is closed under complement and other simulations for sublogarithmic space (Q515583) (← links)
- On the computational complexity of membrane systems (Q596128) (← links)
- Passively mobile communicating machines that use restricted space (Q650876) (← links)
- A note on alternating on-line Turing machines (Q789181) (← links)
- Data structures for distributed counting (Q794431) (← links)
- Computing equilibria: a computational complexity perspective (Q847807) (← links)
- Accepting networks of splicing processors: complexity results (Q870258) (← links)
- A new characterization of NP, P, and PSPACE with accepting hybrid networks of evolutionary processors (Q970101) (← links)
- Translational lemmas for DLOGTIME-uniform circuits, alternating TMs, and PRAMs (Q995752) (← links)
- On small, reduced, and fast universal accepting networks of splicing processors (Q1004084) (← links)
- A space-hierarchy result on two-dimensional alternating Turing machines with only universal states (Q1057650) (← links)
- Complexity lower bounds for machine computing models (Q1057651) (← links)
- The recursion-theoretic structure of complexity classes (Q1064320) (← links)
- On pebble automata (Q1088408) (← links)
- Some observations concerning alternating Turing machines using small space (Q1097697) (← links)
- Remarks on languages acceptable in log log n space (Q1107318) (← links)
- There are no fully space constructible functions between log log n and log n (Q1108005) (← links)
- k\(+1\) heads are better than k for PDAs (Q1109579) (← links)
- Halting space-bounded computations (Q1134515) (← links)
- On time hierarchies (Q1137384) (← links)
- A machine description and the hierarchy of initial Grzegorczyk classes (Q1168308) (← links)
- Space bounded computations: Review and new separation results (Q1176238) (← links)
- Random languages for nonuniform complexity classes (Q1179458) (← links)
- An NP-complete language accepted in linear time by a one-tape Turing machine (Q1183577) (← links)
- On space functions constructed by two-dimensional Turing machines (Q1186366) (← links)
- A survey of space complexity (Q1193412) (← links)
- Minimum-complexity pairing functions (Q1201876) (← links)
- Space bounds for processing contentless inputs (Q1218269) (← links)
- Hierarchies of Turing machines with restricted tape alphabet size (Q1218271) (← links)
- Translational lemmas, polynomial time, and \((\log n)^j\)-space (Q1225932) (← links)
- Comparing complexity classes (Q1227731) (← links)
- Nonexistence of program optimizers in several abstract settings (Q1231391) (← links)
- A characterization of the power of vector machines (Q1232182) (← links)
- On computational reducibility (Q1232281) (← links)
- Techniques for separating space complexity classes (Q1235979) (← links)
- Relating refined space complexity classes (Q1235980) (← links)
- The polynomial-time hierarchy (Q1236109) (← links)
- Bridging across the \(\log(n)\) space frontier (Q1271619) (← links)
- Notes on looping deterministic two-way pushdown automata (Q1318758) (← links)
- An optimal lower bound for nonregular languages (Q1330656) (← links)
- Deterministic versus nondeterministic space in terms of synchronized alternating machines (Q1334670) (← links)
- Space-efficient recognition of sparse self-reducible languages (Q1337147) (← links)
- A remark on middle space bounded alternating Turing machines (Q1350303) (← links)
- On the language of primitive words (Q1351946) (← links)
- Space hierarchy theorem revised. (Q1401238) (← links)
- Amplification of slight probabilistic advantage at absolutely no cost in space (Q1607005) (← links)
- On relationships between complexity classes of Turing machines (Q1682916) (← links)
