Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction (Q2179403): Difference between revisions

@@ Property / cites work @@
+Q3374898
@@ Property / cites work: Q3374898 / rank @@
+Normal rank
@@ Property / cites work @@
+Batch Fully Homomorphic Encryption over the Integers
+Normal rank
@@ Property / cites work @@
+Fully Homomophic Encryption over the Integers Revisited
+Normal rank
@@ Property / cites work @@
+The polynomial approximate common divisor problem and its application to the fully homomorphic encryption
+Normal rank
@@ Property / cites work @@
+Approximate common divisors via lattices
@@ Property / cites work: Approximate common divisors via lattices / rank @@
+Normal rank
@@ Property / cites work @@
+Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
+Normal rank
@@ Property / cites work @@
+Small solutions to polynomial equations, and low exponent RSA vulnerabilities
+Normal rank
@@ Property / cites work @@
+Q4227296
@@ Property / cites work: Q4227296 / rank @@
+Normal rank
@@ Property / cites work @@
+&amp;lt;tex&amp;gt;$QR$&amp;lt;/tex&amp;gt;Factoring to Compute the GCD of Univariate Approximate Polynomials
+Normal rank
@@ Property / cites work @@
+Scale-Invariant Fully Homomorphic Encryption over the Integers
+Normal rank
@@ Property / cites work @@
+Fully Homomorphic Encryption over the Integers with Shorter Public Keys
+Normal rank
@@ Property / cites work @@
+Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
+Normal rank
@@ Property / cites work @@
+Q4717942
@@ Property / cites work: Q4717942 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing approximate greatest common right divisors of differential polynomials
+Normal rank
@@ Property / cites work @@
+Q4660659
@@ Property / cites work: Q4660659 / rank @@
+Normal rank
@@ Property / cites work @@
+Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
+Normal rank
@@ Property / cites work @@
+Improved decoding of Reed-Solomon and algebraic-geometry codes
+Normal rank
@@ Property / cites work @@
+Nearest common root of polynomials, approximate greatest common divisor and the structured singular value
+Normal rank
@@ Property / cites work @@
+Q4787198
@@ Property / cites work: Q4787198 / rank @@
+Normal rank
@@ Property / cites work @@
+Detection and validation of clusters of polynomial zeros
+Normal rank
@@ Property / cites work @@
+Q3902876
@@ Property / cites work: Q3902876 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials
+Normal rank
@@ Property / cites work @@
+On approximate GCDs of univariate polynomials
@@ Property / cites work: On approximate GCDs of univariate polynomials / rank @@
+Normal rank
@@ Property / cites work @@
+Factoring polynomials with rational coefficients
@@ Property / cites work: Factoring polynomials with rational coefficients / rank @@
+Normal rank
@@ Property / cites work @@
+On lattice reduction for polynomial matrices
@@ Property / cites work: On lattice reduction for polynomial matrices / rank @@
+Normal rank
@@ Property / cites work @@
+Oblivious transfer and polynomial evaluation
@@ Property / cites work: Oblivious transfer and polynomial evaluation / rank @@
+Normal rank
@@ Property / cites work @@
+Q4787205
@@ Property / cites work: Q4787205 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate GCD and its application to ill-conditioned algebraic equations
+Normal rank
@@ Property / cites work @@
+On lattices, learning with errors, random linear codes, and cryptography
+Normal rank
@@ Property / cites work @@
+Quasi-gcd computations
@@ Property / cites work: Quasi-gcd computations / rank @@
+Normal rank
@@ Property / cites work @@
+Fully Homomorphic Encryption over the Integers
@@ Property / cites work: Fully Homomorphic Encryption over the Integers / rank @@
+Normal rank
@@ Property / cites work @@
+Resultant matrices and the computation of the degree of an approximate greatest common divisor of two inexact Bernstein basis polynomials
+Normal rank