The following pages link to (Q4249365):
Displaying 30 items.
- Existence and uniqueness of structures computable in polynomial time (Q321268) (← links)
- Metric structures and probabilistic computation (Q541224) (← links)
- Fields of algebraic numbers computable in polynomial time. I (Q784464) (← links)
- Special issue: Selected papers of the workshop on model theory and computable model theory, Gainesville, FL, USA, February 5--10, 2007 (Q1005921) (← links)
- Space complexity of abelian groups (Q1005925) (← links)
- Feasible graphs with standard universe (Q1295403) (← links)
- Complexity and categoricity (Q1383162) (← links)
- Categoricity for primitive recursive and polynomial Boolean algebras (Q1731520) (← links)
- Primitively recursively categorical linear orderings (Q2002476) (← links)
- Non-density in punctual computability (Q2041959) (← links)
- On bi-embeddable categoricity of algebraic structures (Q2067511) (← links)
- Finitely generated structures computable in polynomial time (Q2088618) (← links)
- Quotient structures and groups computable in polynomial time (Q2097210) (← links)
- Searching for applicable versions of computable structures (Q2117745) (← links)
- Fields of algebraic numbers computable in polynomial time. II (Q2145863) (← links)
- Graphs are not universal for online computability (Q2186809) (← links)
- Online presentations of finitely generated structures (Q2205949) (← links)
- Polynomially computable structures with finitely many generators (Q2213937) (← links)
- Structures computable in polynomial time. I (Q2401536) (← links)
- The isomorphism problem on classes of automatic structures with transitive relations (Q2847190) (← links)
- Definable Subsets of Polynomial-Time Algebraic Structures (Q5042236) (← links)
- Rogers semilattices of punctual numberings (Q5048010) (← links)
- A structure of punctual dimension two (Q5111521) (← links)
- (Q5155667) (← links)
- FOUNDATIONS OF ONLINE STRUCTURE THEORY (Q5226592) (← links)
- PUNCTUAL CATEGORICITY AND UNIVERSALITY (Q5858918) (← links)
- Computable embeddability for algebraic structures (Q5876742) (← links)
- Primitive recursive reverse mathematics (Q6050165) (← links)
- A criterion for P-computability of structures (Q6072994) (← links)
- The complexity of inversion in groups (Q6199353) (← links)
