Pages that link to "Item:Q1644852"
From MaRDI portal
The following pages link to Structures computable in polynomial time. II (Q1644852):
Displaying 13 items.
- Constructing punctually categorical semigroups (Q828124) (← links)
- Primitive recursive fields and categoricity (Q2011324) (← links)
- Punctual dimension of algebraic structures in certain classes (Q2030135) (← links)
- Non-density in punctual computability (Q2041959) (← links)
- Fields of algebraic numbers computable in polynomial time. II (Q2145863) (← links)
- Punctual copies of algebraic structures (Q2186304) (← links)
- Graphs are not universal for online computability (Q2186809) (← links)
- Effective categoricity of automatic equivalence and nested equivalence structures (Q2195573) (← links)
- Online presentations of finitely generated structures (Q2205949) (← links)
- Definable Subsets of Polynomial-Time Algebraic Structures (Q5042236) (← links)
- A structure of punctual dimension two (Q5111521) (← links)
- (Q5155667) (← links)
- FOUNDATIONS OF ONLINE STRUCTURE THEORY (Q5226592) (← links)
