Pages that link to "Item:Q5313380"
From MaRDI portal
The following pages link to <i>P</i> versus <i>NP</i> and computability theoretic constructions in complexity theory over algebraic structures (Q5313380):
Displaying 5 items.
- \(\mathbf P =\mathbf{NP}\) for some structures over the binary words (Q2387422) (← links)
- From determinism, non-determinism and alternation to recursion schemes for P, NP and Pspace (Invited Talk) (Q2958508) (← links)
- (Q4779131) (← links)
- Comparing Constructive Arithmetical Theories Based on NP-PIND and coNP-PIND (Q4812318) (← links)
- On Relativizations of the P =? NP Question for Several Structures (Q4918006) (← links)