Pages that link to "Item:Q3489983"
From MaRDI portal
The following pages link to Every recursive linear ordering has a copy in DTIME-SPACE(<i>n</i>,log(<i>n</i>)) (Q3489983):
Displaying 28 items.
- Algebraic structures computable without delay (Q528478) (← links)
- Space complexity of abelian groups (Q1005925) (← links)
- Polynomial-time versus recursive models (Q1182471) (← links)
- Polynomial-time Abelian groups (Q1192353) (← links)
- Feasible graphs with standard universe (Q1295403) (← links)
- Complexity and categoricity (Q1383162) (← links)
- Eliminating unbounded search in computable algebra (Q2011637) (← links)
- Punctual dimension of algebraic structures in certain classes (Q2030135) (← links)
- Non-density in punctual computability (Q2041959) (← links)
- Searching for applicable versions of computable structures (Q2117745) (← links)
- Punctual copies of algebraic structures (Q2186304) (← links)
- Graphs are not universal for online computability (Q2186809) (← links)
- The back-and-forth method and computability without delay (Q2279959) (← links)
- Structures computable in polynomial time. I (Q2401536) (← links)
- Definable Subsets of Polynomial-Time Algebraic Structures (Q5042236) (← links)
- A structure of punctual dimension two (Q5111521) (← links)
- (Q5155667) (← links)
- AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES (Q5207571) (← links)
- FOUNDATIONS OF ONLINE STRUCTURE THEORY (Q5226592) (← links)
- Complexity, decidability and completeness (Q5480615) (← links)
- Borel and Hausdorff hierarchies in topological spaces of Choquet games and their effectivization (Q5740666) (← links)
- PUNCTUAL CATEGORICITY AND UNIVERSALITY (Q5858918) (← links)
- Computable embeddability for algebraic structures (Q5876742) (← links)
- Primitive recursive ordered fields and some applications (Q5880940) (← links)
- Preface (Q5900158) (← links)
- Primitive recursive reverse mathematics (Q6050165) (← links)
- Punctual 1-linear orders (Q6059288) (← links)
- Feasibly categorical models (Q6064288) (← links)