Pages that link to "Item:Q1165896"
From MaRDI portal
The following pages link to Factoring polynomials with rational coefficients (Q1165896):
Displaying 50 items.
- On membership comparable sets (Q1961377) (← links)
- Functor of points and height functions for noncommutative Arakelov geometry (Q1984389) (← links)
- A verified implementation of the Berlekamp-Zassenhaus factorization algorithm (Q1984794) (← links)
- Polynomial computability of fields of algebraic numbers (Q1994088) (← links)
- Partial strategyproofness: relaxing strategyproofness for the random assignment problem (Q1995295) (← links)
- Coppersmith's lattices and ``focus groups'': an attack on small-exponent RSA (Q1998906) (← links)
- Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes (Q2000290) (← links)
- Analysis of DeepBKZ reduction for finding short lattice vectors (Q2004968) (← links)
- Deterministic normal position transformation and its applications (Q2006776) (← links)
- On the Diophantine equation \(\binom{n}{k} = \binom{m}{l} + d\) (Q2009174) (← links)
- Small CRT-exponent RSA revisited (Q2010590) (← links)
- Uniform rates of approximation by short asymptotic expansions in the CLT for quadratic forms (Q2016262) (← links)
- New number-theoretic cryptographic primitives (Q2023304) (← links)
- Short principal ideal problem in multicubic fields (Q2023319) (← links)
- Algorithms for CRT-variant of approximate greatest common divisor problem (Q2025331) (← links)
- Finding small solutions of the equation \(Bx-Ay=z\) and its applications to cryptanalysis of the RSA cryptosystem (Q2025379) (← links)
- Noisy polynomial interpolation modulo prime powers (Q2034569) (← links)
- The shortest vector problem and tame kernels of cyclotomic fields (Q2039518) (← links)
- Numerical performance of optimized Frolov lattices in tensor product reproducing kernel Sobolev spaces (Q2040459) (← links)
- Quantum algorithms for computing general discrete logarithms and orders with tradeoffs (Q2048182) (← links)
- On the mortality problem: from multiplicative matrix equations to linear recurrence sequences and beyond (Q2051775) (← links)
- Approximate CVP\(_p\) in time \(2^{0.802n}\) (Q2051858) (← links)
- A Lucas-Lehmer approach to generalised Lebesgue-Ramanujan-Nagell equations (Q2052846) (← links)
- A \(2^{n/2}\)-time algorithm for \(\sqrt{n} \)-SVP and \(\sqrt{n} \)-Hermite SVP, and an improved time-approximation tradeoff for (H)SVP (Q2056696) (← links)
- On bounded distance decoding with predicate: breaking the ``lattice barrier'' for the hidden number problem (Q2056699) (← links)
- On the ideal shortest vector problem over random rational primes (Q2056701) (← links)
- The convergence of slide-type reductions (Q2061912) (← links)
- On the success probability of solving unique SVP via BKZ (Q2061913) (← links)
- Rank and border rank of Kronecker powers of tensors and Strassen's laser method (Q2062866) (← links)
- Lattice size and generalized basis reduction in dimension three (Q2066314) (← links)
- Algorithmically solving the tadpole problem (Q2067210) (← links)
- Calculating ``small'' solutions of inhomogeneous relative Thue inequalities (Q2075017) (← links)
- The tadpole problem (Q2083088) (← links)
- A deterministic algorithm for finding \(r\)-power divisors (Q2093686) (← links)
- Exact result in \(\mathcal{N} = 4\) SYM theory: generalised double-logarithmic equation (Q2094806) (← links)
- A polynomial-time algorithm for solving the hidden subset sum problem (Q2096513) (← links)
- Fast reduction of algebraic lattices over cyclotomic fields (Q2096520) (← links)
- Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\) (Q2096521) (← links)
- Lattice reduction for modules, or how to reduce ModuleSVP to ModuleSVP (Q2096523) (← links)
- Slide reduction, revisited -- filling the gaps in SVP approximation (Q2096526) (← links)
- Notes on computational hardness of hypothesis testing: predictions using the low-degree likelihood ratio (Q2103494) (← links)
- Simple periodic boundary conditions for molecular simulation of uniaxial flow (Q2106954) (← links)
- BBP-type formulas -- an elementary approach (Q2112783) (← links)
- A physical study of the LLL algorithm (Q2112788) (← links)
- Deep learning Gauss-Manin connections (Q2113261) (← links)
- A practical algorithm for completing half-Hadamard matrices using LLL (Q2114786) (← links)
- Search for combinatorial objects using lattice algorithms -- revisited (Q2115837) (← links)
- Short simplex paths in lattice polytopes (Q2117352) (← links)
- Generating cryptographically-strong random lattice bases and recognizing rotations of \(\mathbb{Z}^n\) (Q2118552) (← links)
- Revisiting orthogonal lattice attacks on approximate common divisor problems (Q2118873) (← links)
