Pages that link to "Item:Q1071803"
From MaRDI portal
The following pages link to Solvability by radicals is in polynomial time (Q1071803):
Displaying 27 items.
- Automatic constructibility checking of a corpus of geometric construction problems (Q294375) (← links)
- Computational complexity of sentences over fields (Q937294) (← links)
- A note on ``Zippel denesting'' (Q1186700) (← links)
- Polynomial time algorithms for sentences over number fields (Q1187032) (← links)
- \(\sqrt{2}+\sqrt{3}\): Four different views (Q1284617) (← links)
- Sentences over integral domains and their computational complexities (Q1286369) (← links)
- On computing subfields. A detailed description of the algorithm (Q1292617) (← links)
- How to tangle with a nested radical (Q1345068) (← links)
- General formulas for solving solvable sextic equations (Q1593803) (← links)
- On the mechanization of straightedge and compass constructions (Q1730306) (← links)
- Solving degenerate sparse polynomial systems faster (Q1808666) (← links)
- The inapproximability of lattice and coding problems with preprocessing (Q1881262) (← links)
- Counting invariant subspaces and decompositions of additive polynomials (Q1994893) (← links)
- Computing groups of Hecke characters (Q2093681) (← links)
- Compositions and collisions at degree \(p^2\) (Q2437328) (← links)
- Computation of unirational fields (Q2457397) (← links)
- Hardness of approximating the shortest vector problem in high \(\ell_{p}\) norms (Q2490259) (← links)
- Polynomial factorization algorithms over number fields (Q2643570) (← links)
- La réduction des réseaux. Autour de l'algorithme de Lenstra, Lenstra, Lovász (Q3033847) (← links)
- Computer Theorem Proving for Verifiable Solving of Geometric Construction Problems (Q3452277) (← links)
- Algorithms in Algebraic Number Theory (Q4005808) (← links)
- Solving polynomials by radicals with roots of unity in minimum depth (Q4235526) (← links)
- Block Systems of a Galois Group (Q4867488) (← links)
- Polynomial decomposition algorithms (Q5893804) (← links)
- Tame decompositions and collisions (Q5925210) (← links)
- Galois group computation for rational polynomials (Q5927989) (← links)
- Kronecker's and Newton's approaches to solving: a first comparison (Q5938585) (← links)
