Pages that link to "Item:Q2366722"
From MaRDI portal
The following pages link to Algorithmic aspects of Suslin's proof of Serre's conjecture (Q2366722):
Displaying 19 items.
- An algorithm for unimodular completion over Laurent polynomial rings (Q947632) (← links)
- Algorithms for the Quillen-Suslin theorem (Q1183295) (← links)
- An algorithm for the Quillen-Suslin theorem for monoid rings (Q1358921) (← links)
- On Gurevich's theorem on sequential algorithms (Q1424349) (← links)
- A generic effective Nullstellensatz (Q1774958) (← links)
- A new algorithm for the Quillen-Suslin theorem (Q1975382) (← links)
- Bounding the degrees of a minimal \(\mu\)-basis for a rational surface parametrization (Q2000266) (← links)
- Suslin's algorithms for reduction of unimodular rows (Q2456568) (← links)
- An algorithm for unimodular completion over noetherian rings (Q2464486) (← links)
- Bounds for degrees of syzygies of polynomials defining a grade two ideal (Q2674001) (← links)
- Some conjectures on multivariate polynomial matrices (Q2702517) (← links)
- On Suslin's stability theorem for \(R[x_1,\dots,x_m]\) (Q2738456) (← links)
- A novel proof of the Souriau-Frame-Faddeev algorithm (Q3143017) (← links)
- (Q3397627) (← links)
- (Q3424894) (← links)
- An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the Černy Conjecture (Q5756675) (← links)
- (Q5874491) (← links)
- An algorithm for the Quillen-Suslin theorem for quotients of polnomial rings by monomial ideals (Q5926299) (← links)
- Computing bases of complete intersection rings in Noether position (Q5946450) (← links)
