Pages that link to "Item:Q4379625"

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

Displayed 8 items.

• On approximate and algebraic computability over the real numbers (Q1292404) ‎ (← links)
• On the cost of uniform and nonuniform algorithms (Q1292410) ‎ (← links)
• A topological view on algebraic computation models (Q1679677) ‎ (← links)
• On the P-NP problem over real matrix rings (Q1884926) ‎ (← links)
• \(\mathbf P =\mathbf{NP}\) for some structures over the binary words (Q2387422) ‎ (← 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)