Reconstructing algebraic functions from mixed data

No abstract is available for this paper.

• Publication year

  1992

• Venue

  Proceedings., 33rd Annual Symposium on Foundations of Computer Science

• Publication date

  1992-10-24

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/SFCS.1992.267801
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Introduction to finite fields and their applications: Theoretical Applications of Finite Fields

  1994cited by this paper
• A new modular interpolation algorithm for factoring multivariate polynominals

  1994cited by this paper
• Decision Theoretic Generalizations of the PAC Model for Neural Net and Other Learning Applications

  1992cited by this paper
• Highly Resilient Correctors for Polynomials

  1992cited by this paper
• Learning switching concepts

  1992cited by this paper
• Self-testing/correcting for polynomials and for approximate functions

  1991influential reference
• Algebraic Complexity Theory

  1991cited by this paper
• Algorithms for sparse rational interpolation

  1991cited by this paper
• Learning decision trees using the Fourier spectrum

  1991cited by this paper
• Hiding Instances in Multioracle Queries

  1990cited by this paper
• Interpolating Polynomials from Their Values

  1990cited by this paper
• Self-testing/correcting with applications to numerical problems

  1990cited by this paper
• Interpolation of sparse rational functions without knowing bounds on exponents

  1990cited by this paper
• A hard-core predicate for all one-way functions

  1989cited by this paper
• New Directions In Testing

  1989cited by this paper
• A deterministic algorithm for sparse multivariate polynomial interpolation

  1988cited by this paper
• Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators

  1988cited by this paper
• Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields

  1988cited by this paper
• Algebraic curves

  1988cited by this paper
• Algebraic complexity theory

  1988cited by this paper
• Occam's Razor

  1987cited by this paper
• Factorization of polynomials over a finite field and the solution of systems of algebraic equations

  1986cited by this paper
• A theory of the learnable

  1984cited by this paper
• Finding Edges and Lines in Images

  1983cited by this paper
• A polynomial-time reduction from bivariate to univariate integral polynomial factorization

  1982cited by this paper
• Factoring polynomials with rational coefficients

  1982cited by this paper
• Probabilistic algorithms in finite fields

  1980cited by this paper
• Probabilistic algorithms for sparse polynomials

  1979cited by this paper
• Theory of edge detection

  1979cited by this paper
• Factoring polynomials over large finite fields*

  1970cited by this paper
• Algebra, Volume 1

  1969cited by this paper

• Nearly Optimal Pseudorandomness From Hardness

  2020cites this paper
• WSN key management scheme based on fully bomomorphic encryption

  2017cites this paper
• Big data interpolation using functional representation

  2016cites this paper
• Chinese Remaindering with ErrorsOded Goldreich

  2014influential citation
• On the Algorithms of Guruswami-Sudan List Decoding over Finite Rings. (Sur l'algorithme de décodage en liste de Guruswami-Sudan sur les anneaux finis)

  2012cites this paper
• New Limits to Classical and Quantum Instance Compression

  2012cites this paper
• Automatic vector generation guided by a functional metric

  2011cites this paper
• Bridging Shannon and Hamming: List Error-Correction with Optimal Rate

  2011cites this paper
• Toward anonymity in Delay Tolerant Networks: Threshold Pivot Scheme

  2010cites this paper
• Introduction to Coding Theory CMU: Spring 2010 Notes 9: Expander codes, beginning of list decoding

  2010cites this paper
• Identification codes in cryptographic protocols

  2010cites this paper
• Decoding Reed-Solomon Codes and Concatenated codes

  2010cites this paper
• Attacking cryptographic schemes based on "perturbation polynomials"

  2009influential citation
• Private Interrogation of Devices via Identification Codes

  2009cites this paper
• Decoding Ag-codes and Let W Be a Vector Having Acknowledgments Decoding Ag-codes

  2007cites this paper
• List decoding and property testing of error-correcting codes

  2007influential citation
• Algorithmic Results in List Decoding

  2006cites this paper
• Trade-offs in probabilistic packet marking for IP traceback

  2005influential citation
• Formal meaning of coverage metrics in simulation-based hardware design verification

  2005cites this paper
• The enumerability of P collapses P to NC

  2005influential citation
• Noisy interpolation of sparse polynomials in finite fields

  2005cites this paper
• Noisy Chinese remaindering in the Lee norm

  2004cites this paper
• Linear-Time List Decoding in Error-Free Settings: (Extended Abstract)

  2004influential citation
• Linear time encodable and list decodable codes

  2003cites this paper
• Query complexity of membership comparable sets

  2003cites this paper
• Alternative Notions of Approximation and Space-Bounded Computations

  2003cites this paper
• The Guruswami-Sudan Decoding Algorithm for Reed-Solomon Codes

  2003cites this paper
• Hiding program slices for software security

  2003cites this paper
• An algebraic approach to IP traceback

  2002cites this paper
• Fitting algebraic curves to noisy data

  2002cites this paper
• Reections on \Improved Decoding of Reed-Solomon and Algebraic-Geometric Codes"

  2002cites this paper
• Near-optimal sparse fourier representations via sampling

  2002cites this paper
• A displacement approach to decoding algebraic codes

  2001cites this paper
• Online Performance-Improvement Algorithms

  2001cites this paper
• Adaptive Genetic Programming Applied to New and Existing Simple Regression Problems

  2001cites this paper
• Approximate evaluations of characteristic polynomials of Boolean functions

  2001cites this paper
• 3GPP KASUMI Evaluation Report : 3rd Generation Partnership Project; Security Algorithms Group of Experts (SAGE); Report on the Evaluation of 3GPP Standard Confidentiality and Integrity Algorithms (SAGE version 2.0)

  2001cites this paper
• Coding theory: tutorial & survey

  2001influential citation
• List decoding of error correcting codes

  2001cites this paper
• Ideal Error-Correcting Codes: Unifying Algebraic and Number-Theoretic Algorithms

  2001cites this paper
• Decoding Reed-Muller Codes beyond Half the Minimum Distance

  2001cites this paper
• Tradeoffs in probabilistic packet marking for IP traceback

  2001cites this paper
• Sparse polynomial approximation in finite fields

  2001cites this paper
• ETSI SAGE 3GPP Standard Algorithms Task Force

  2000cites this paper
• Finding smooth integers in short intervals using CRT decoding

  2000cites this paper
• Noisy Polynomial Interpolation and Noisy Chinese Remaindering

  2000cites this paper
• Security Algorithms Group of Experts (SAGE) Report on the Evaluation of 3GPP Standard Confidentiality and Integrity Algorithms

  2000cites this paper
• List decoding: algorithms and applications

  2000cites this paper
• Noisy Polynomial Interpolationand Noisy Chinese Remaindering ( Full Version )

  2000cites this paper
• A Displacement Structure Approach to List Decoding of Reed-Solomon and Algebraic-Geometric Codes ∗

  2000cites this paper
• Improved decoding of Reed-Solomon and algebraic-geometry codes

  1999cites this paper
• Pseudorandom generators without the XOR lemma

  1999cites this paper
• Chinese remaindering with errors

  1999influential citation
• Sparse Sets, Approximable Sets, and Parallel Queries to NP

  1999cites this paper
• Proofs, codes, and polynomial-time reducibilities

  1999cites this paper
• On Learning Functions from Noise-Free and Noisy Samples via Occam's Razor

  1999cites this paper
• A displacement approach to efficient decoding of algebraic-geometric codes

  1999cites this paper
• On the Hardness of Permanent

  1999cites this paper
• List Decoding of Algebraic-Geometric Codes

  1999influential citation
• Reflections on “ Improved Decoding of Reed-Solomon and Algebraic-Geometric Codes ”

  1999cites this paper
• Reconstructing randomly sampled multivariate polynomials from highly noisy data

  1998cites this paper
• Decoding algebraic-geometric codes beyond the error-correction bound

  1998influential citation
• On membership comparable sets

  1998cites this paper
• Improved decoding of Reed-Solomon and algebraic-geometric codes

  1998cites this paper
• Cryptanalysis of Block Ciphers with Probabilistic Non-linear Relations of Low Degree

  1998cites this paper
• Decoding of Reed Solomon Codes beyond the Error-Correction Bound

  1997influential citation
• Decoding Reed Solomon Codes beyond the Error-Correction Diameter

  1997cites this paper
• Improved Low-Degree Testing and its Applications

  1997influential citation
• Algorithmic Issues in Coding Theory

  1997cites this paper
• Maximum likelihood decoding of Reed Solomon codes

  1996influential citation
• Efficient Checking of Polynomials and Proofs and the Hardness of Appoximation Problems

  1995cites this paper
• Learning polynomials with queries: The highly noisy case

  1995cites this paper
• Learning sparse multivariate polynomials over a field with queries and counterexamples

  1993cites this paper
• Introduction to Coding Theory

  1993cites this paper
• Occam's razor for functions

  1993cites this paper
• Learning switching concepts

  1992cites this paper
• Highly Resilient Correctors for Polynomials

  1992cites this paper
• The Guruswam-sudan Decoding Algorithm for Reed-solomon Codes

  year unknowncites this paper
• Introduction to Algebraic Soft-decision Decoding of Reed-solomon Codes

  year unknowncites this paper