Pages that link to "Item:Q4532627"
From MaRDI portal
The following pages link to A model-theoretic proof for <i>P ≠ NP</i> over all infinite abelian group (Q4532627):
Displaying 5 items.
- Real computational universality: the word problem for a class of groups with infinite presentation (Q734136) (← 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)
- Two situations with unit-cost: ordered abelian semi-groups and some commutative rings (Q2387423) (← links)
- <i>P</i> versus <i>NP</i> and computability theoretic constructions in complexity theory over algebraic structures (Q5313380) (← links)
