The following pages link to Theoretical Computer Science (Q123643):
Displaying 50 items.
- On-line computation of minimal and maximal length paths (Q1184981) (← links)
- The ring of \(k\)-regular sequences (Q1193879) (← links)
- On read-once vs. multiple access to randomness in logspace (Q1208412) (← links)
- Undirected edge geography (Q1210301) (← links)
- Note on the topological structure of random strings (Q1210302) (← links)
- The memory game (Q1210544) (← links)
- Some simplified NP-complete graph problems (Q1230637) (← links)
- The polynomial-time hierarchy (Q1236109) (← links)
- LCF considered as a programming language (Q1243117) (← links)
- The Euclidean traveling salesman problem is NP-complete (Q1250163) (← links)
- Intuitionistic propositional logic is polynomial-space complete (Q1259589) (← links)
- Complete sets of transformations for general E-unification (Q1262754) (← links)
- Testing the necklace condition for shortest tours and optimal factors in the plane (Q1262765) (← links)
- On topological dynamics of Turing machines (Q1269915) (← links)
- Contributions of Ronald V. Book to the theory of string-rewriting systems (Q1274982) (← links)
- On tables of random numbers (Q1275012) (← links)
- Characterizations of recursively enumerable languages by means of insertion grammars (Q1275078) (← links)
- Fusion trees can be implemented with \(AC^0\) instructions only (Q1287094) (← links)
- Formal parametric polymorphism (Q1314344) (← links)
- A type-theoretical alternative to ISWIM, CUCH, OWHY (Q1314363) (← links)
- Adding closed world assumptions to well-founded semantics (Q1314417) (← links)
- A linear algorithm for renaming a set of clauses as a Horn set (Q1318709) (← links)
- Average cost of Duval's algorithm for generating Lyndon words (Q1334678) (← links)
- Separation of complexity classes in Koiran's weak model (Q1338212) (← links)
- Rice's theorem for the limit sets of cellular automata (Q1342233) (← links)
- Proofs as processes (Q1342245) (← links)
- Constant-only multiplicative linear logic is NP-complete (Q1342254) (← links)
- Almost every set in exponential time is P-bi-immune (Q1349712) (← links)
- Lower bounds for one-way probabilistic communication complexity and their application to space complexity (Q1351496) (← links)
- Complexity lower bounds for computation trees with elementary transcendental function gates (Q1365876) (← links)
- Incremental constraint satisfaction for equational logic programming (Q1367535) (← links)
- The parameterized complexity of sequence alignment and consensus (Q1367540) (← links)
- A first order logic of effects (Q1390955) (← links)
- Continuity spaces: Reconciling domains and metric spaces (Q1391864) (← links)
- On three variants of rewriting P systems (Q1399988) (← links)
- Complexity of DNA sequencing by hybridization. (Q1401172) (← links)
- Optimal binary search trees with costs depending on the access paths. (Q1401195) (← links)
- A probabilistic analysis of randomly generated binary constraint satisfaction problems. (Q1401196) (← links)
- Turning back time in Markovian process algebra. (Q1401206) (← links)
- Synchronizing finite automata on Eulerian digraphs. (Q1401241) (← links)
- Mixed hypergraphs with bounded degree: Edge-coloring of mixed multigraphs. (Q1401245) (← links)
- Gemmating P systems: Collapsing hierarchies. (Q1401271) (← links)
- Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines (Q1434368) (← links)
- Some APX-completeness results for cubic graphs (Q1566710) (← links)
- Mobile ambients (Q1575154) (← links)
- Decidability and complexity of simultaneous rigid E-unification with one variable and related results (Q1575636) (← links)
- Full abstraction for idealized Algol with passive expressions (Q1575874) (← links)
- Using DNA to solve the bounded Post correspondence problem (Q1575917) (← links)
- Domain representations of topological spaces (Q1583255) (← links)
- Thin discrete triangular meshes (Q1583599) (← links)
