Pages that link to "Item:Q4379625"

The following pages link to Computability of String Functions Over Algebraic Structures Armin Hemmerling (Q4379625):

Displaying 13 items.

• On approximate and algebraic computability over the real numbers (Q1292404) (← links)
• On the cost of uniform and nonuniform algorithms (Q1292410) (← links)
• On the relations between distributive computability and the BSS model (Q1349919) (← links)
• A topological view on algebraic computation models (Q1679677) (← links)
• On the P-NP problem over real matrix rings (Q1884926) (← links)
• A formal framework for stringology (Q2295636) (← links)
• \(\mathbf P =\mathbf{NP}\) for some structures over the binary words (Q2387422) (← links)
• Algebraic string operations (Q2465474) (← links)
• (Q3360360) (← links)
• Computability Over Structures of Infinite Signature (Q4210842) (← links)
• Computation over algebraic structures and a classification of undecidable problems (Q4593236) (← links)
• <i>P</i> versus <i>NP</i> and computability theoretic constructions in complexity theory over algebraic structures (Q5313380) (← links)
• The P-DNP problem for infinite Abelian groups (Q5949384) (← links)