Pages that link to "Item:Q1165896"

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

Displaying 50 items.

• Complexity of computations in Commutative Division of the USSR Academy of Sciences (Q1173942) (← links)
• Approximate factorization of multivariate polynomials and absolute irreducibility testing (Q1179781) (← links)
• A heuristic irreducibility test for univariate polynomials (Q1186702) (← links)
• Polynomial time algorithms for sentences over number fields (Q1187032) (← links)
• A note on the \(f\)-factor-lattice of bipartite graphs (Q1204470) (← links)
• Improved low-density subset sum algorithms (Q1207335) (← links)
• On interpolating arithmetic read-once formulas with exponentiation (Q1267719) (← links)
• A relation of primal--dual lattices and the complexity of shortest lattice vector problem (Q1274988) (← links)
• Sentences over integral domains and their computational complexities (Q1286369) (← links)
• New \(t\)-designs and large sets of \(t\)-designs (Q1292816) (← links)
• Renormalization automated by Hopf algebra (Q1300631) (← links)
• Simultaneous reduction of a lattice basis and its reciprocal basis (Q1311020) (← links)
• Recognizing badly presented \(Z\)-modules (Q1311319) (← links)
• An upper bound on the average number of iterations of the LLL algorithm (Q1314406) (← links)
• An algorithm for finding a shortest vector in a two-dimensional modular lattice (Q1318688) (← links)
• A partial digest approach to restriction site mapping (Q1319891) (← links)
• Computation and rationality of Belyi functions in genus zero (Q1323148) (← links)
• On the period matrix of a Riemann surface of large genus (with an appendix by J. H. Conway and N. J. A. Sloane) (Q1328153) (← links)
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems (Q1340057) (← links)
• Distribution of Hermite's constant and the shortest vector in lattices of dimension two (Q1340684) (← links)
• Factorization properties of lattices over the integers (Q1345515) (← links)
• Factoring multivariate integral polynomials (Q1348530) (← links)
• The hardness of approximate optima in lattices, codes, and systems of linear equations (Q1356888) (← links)
• Solving norm form equations via lattice basis reduction (Q1359135) (← links)
• Diophantine approximation of matrices (Q1359157) (← links)
• Polar varieties, real equation solving, and data structures: the hypersurface case (Q1361872) (← links)
• Real data-integer solution problems within the Blum-Shub-Smale computational model (Q1368838) (← links)
• Straight-line programs in geometric elimination theory (Q1380007) (← links)
• The optimal LLL algorithm is still polynomial in fixed dimension. (Q1401288) (← links)
• Tile invariants: New horizons. (Q1401369) (← links)
• On lattice reduction for polynomial matrices (Q1401903) (← links)
• The better bound of private key in RSA with unbalanced primes (Q1406195) (← links)
• Computing the sign or the value of the determinant of an integer matrix, a complexity survey. (Q1421221) (← links)
• On the solution of units and index form equations in algebraic number fields (Q1568078) (← links)
• On the limits of nonapproximability of lattice problems (Q1577010) (← links)
• Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey (Q1581129) (← links)
• Complexity of the Havas, Majewski, Matthews LLL Hermite normal form algorithm (Q1587234) (← links)
• Approximate solutions of polynomial equations. (Q1599546) (← links)
• Short vectors of planar lattices via continued fractions (Q1603456) (← links)
• The chords' problem (Q1603719) (← links)
• Approximating \(SVP_{\infty}\) to within almost-polynomial factors is NP-hard (Q1608337) (← links)
• Connected components of the moduli of elliptic \(K3\) surfaces (Q1616285) (← links)
• Cryptanalysis of a public key cryptosystem based on Diophantine equations via weighted LLL reduction (Q1630230) (← links)
• Return of GGH15: provable security against zeroizing attacks (Q1631349) (← links)
• On the hardness of the computational ring-LWR problem and its applications (Q1633465) (← links)
• Twist-2 at seven loops in planar \( \mathcal{N} =4\) SYM theory: full result and analytic properties (Q1636417) (← links)
• Planckian axions and the weak gravity conjecture (Q1638133) (← links)
• Fiat-Shamir and correlation intractability from strong KDM-secure encryption (Q1648782) (← links)
• Shortest vector from lattice sieving: a few dimensions for free (Q1648783) (← links)
• Solving a class of modular polynomial equations and its relation to modular inversion hidden number problem and inversive congruential generator (Q1650812) (← links)