Pages that link to "Item:Q2401536"
From MaRDI portal
The following pages link to Structures computable in polynomial time. I (Q2401536):
Displayed 25 items.
- Fields of algebraic numbers computable in polynomial time. I (Q784464) (← links)
- Constructing punctually categorical semigroups (Q828124) (← links)
- Structures computable in polynomial time. II (Q1644852) (← links)
- Categoricity for primitive recursive and polynomial Boolean algebras (Q1731520) (← links)
- Polynomial computability of fields of algebraic numbers (Q1994088) (← links)
- Primitively recursively categorical linear orderings (Q2002476) (← 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)
- Primitively recursive categoricity for unars and equivalence structures (Q2054224) (← links)
- Finitely generated structures computable in polynomial time (Q2088618) (← links)
- Complexity issues for the iterated \(h\)-preorders (Q2096579) (← 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)
- 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)
- Polynomially computable structures with finitely many generators (Q2213937) (← 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)
- A criterion for P-computability of structures (Q6072994) (← links)