Pages that link to "Item:Q370288"
From MaRDI portal
The following pages link to A non-NP-complete algorithm for a quasi-fixed polynomial problem (Q370288):
Displaying 7 items.
- Infinitely many eigenfunctions for polynomial problems: exact results (Q305473) (← links)
- A polynomial-time algorithm for computing the yolk in fixed dimension (Q687092) (← links)
- New quasi-coincidence point polynomial problems (Q1791406) (← links)
- Infinitely many quasi-coincidence point solutions of multivariate polynomial problems (Q2015347) (← links)
- (Q3558977) (← links)
- (Q5388139) (← links)
- A Non-2-step Nilsystem With Linear Polynomial Complexity (Q5497990) (← links)