Pages that link to "Item:Q1165896"

The following pages link to Factoring polynomials with rational coefficients (Q1165896):

Displaying 16 items.

• Loop-reduction LLL algorithm and architecture for lattice-reduction-aided MIMO detection (Q415838) (← links)
• Proper reparametrization for inherently improper unirational varieties (Q646768) (← links)
• Non-standard approaches to integer programming (Q697562) (← links)
• The inverse moment problem for convex polytopes (Q714983) (← links)
• Finding shortest lattice vectors faster using quantum search (Q887421) (← links)
• Solvability by radicals is in polynomial time (Q1071803) (← links)
• On Lovász' lattice reduction and the nearest lattice point problem (Q1076512) (← links)
• A strongly polynomial minimum cost circulation algorithm (Q1079110) (← links)
• Formalizing the LLL basis reduction algorithm and the LLL factorization algorithm in Isabelle/HOL (Q2209537) (← links)
• Bounding basis reduction properties (Q2364641) (← links)
• An Experimental Study of Kannan’s Embedding Technique for the Search LWE Problem (Q3297526) (← links)
• On the linear independence measure of logarithms of rational numbers (Q4794649) (← links)
• Singular Value Decomposition of Complexes (Q5234536) (← links)
• Recovering Exact Results from Inexact Numerical Data in Algebraic Geometry (Q5298836) (← links)
• Random Sampling Revisited: Lattice Enumeration with Discrete Pruning (Q5738970) (← links)
• Factoring polynomials over finite fields: A survey (Q5928877) (← links)