Pages that link to "Item:Q1182471"
From MaRDI portal
The following pages link to Polynomial-time versus recursive models (Q1182471):
Displaying 42 items.
- Existence and uniqueness of structures computable in polynomial time (Q321268) (← links)
- Algebraic structures computable without delay (Q528478) (← links)
- Space complexity of abelian groups (Q1005925) (← links)
- Polynomial-time Abelian groups (Q1192353) (← links)
- Recursively presented games and strategies (Q1196205) (← links)
- Countable thin \(\Pi^0_1\) classes (Q1208080) (← links)
- Computable isomorphisms, degree spectra of relations, and Scott families (Q1295389) (← links)
- Feasible graphs with standard universe (Q1295403) (← links)
- Complexity and categoricity (Q1383162) (← links)
- Structures computable in polynomial time. II (Q1644852) (← links)
- The diversity of categoricity without delay (Q1688181) (← links)
- Categoricity for primitive recursive and polynomial Boolean algebras (Q1731520) (← links)
- On the lattices of NP-subspaces of a polynomial time vector space over a finite field (Q1923577) (← links)
- Polynomial computability of fields of algebraic numbers (Q1994088) (← links)
- Eliminating unbounded search in computable algebra (Q2011637) (← links)
- Punctual dimension of algebraic structures in certain classes (Q2030135) (← 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)
- On efficiency of notations for natural numbers (Q2143116) (← links)
- Punctual copies of algebraic structures (Q2186304) (← 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)
- The back-and-forth method and computability without delay (Q2279959) (← links)
- Structures computable in polynomial time. I (Q2401536) (← links)
- Well-Quasi Orders and Hierarchy Theory (Q3295154) (← links)
- Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision (Q4995607) (← 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)
- Computable embeddability for algebraic structures (Q5876742) (← links)
- Primitive recursive ordered fields and some applications (Q5880940) (← links)
- Primitive recursive reverse mathematics (Q6050165) (← links)
- A criterion for P-computability of structures (Q6072994) (← links)
- Inversion operations in algebraic structures (Q6146820) (← links)
- Punctually presented structures I: Closure theorems (Q6146821) (← links)
- The complexity of inversion in groups (Q6199353) (← links)
