On the public citation graph
Effective Noether Irreducibility Forms and Applications
0 signed · 59 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jabr.2000.8586openalex-snapshot
Absolute Irreducibility of Polynomials via Newton Polytopes
inferred← citeshttps://doi.org/10.1006/jagm.1999.1045openalex-snapshot
Interpolation of Sparse Multivariate Polynomials over Large Finite Fields with Applications
inferred← citeshttps://doi.org/10.1006/jagm.2000.1098openalex-snapshot
Extended Hilbert Irreducibility and Its Applications
inferred← citeshttps://doi.org/10.1006/jsco.1998.0271openalex-snapshot
Solving Degenerate Sparse Polynomial Systems Faster
inferred← citeshttps://doi.org/10.1006/jsco.2000.0370openalex-snapshot
Challenges of Symbolic Computation: My Favorite Open Problems
inferred← citeshttps://doi.org/10.1006/jsco.2002.0564openalex-snapshot
Linear Differential Operators for Polynomial Equations
inferred← citeshttps://doi.org/10.1007/11555964_27openalex-snapshot
Towards More Accurate Separation Bounds of Empirical Polynomials II
inferred← citeshttps://doi.org/10.1007/978-0-387-75155-9_4openalex-snapshot
Efficient Inversion of Rational Maps Over Finite Fields
inferred← citeshttps://doi.org/10.1007/978-3-031-52969-6_34openalex-snapshot
New Absolute Irreducibility Testing Criteria and Factorization of Multivariate Polynomials
inferred← citeshttps://doi.org/10.1007/978-3-662-44777-2_11openalex-snapshot
Polynomial Decompositions in Polynomial Time
inferred← citeshttps://doi.org/10.1007/bfb0054889openalex-snapshot
An algorithm for approximate counting of points on algebraic sets over finite fields
inferred← citeshttps://doi.org/10.1007/s00037-015-0102-yopenalex-snapshot
Equivalence of Polynomial Identity Testing and Polynomial Factorization
inferred← citeshttps://doi.org/10.1007/s00037-021-00215-0openalex-snapshot
Factorization of Polynomials Given by Arithmetic Branching Programs
inferred← citeshttps://doi.org/10.1007/s00200-010-0121-5openalex-snapshot
New recombination algorithms for bivariate polynomial factorization based on Hensel lifting
inferred← citeshttps://doi.org/10.1007/s10958-010-0177-6openalex-snapshot
Nonsingular points on hypersurfaces over $ \mathbb{F}_q $
inferred← citeshttps://doi.org/10.1016/j.ffa.2005.03.003openalex-snapshot
Improved explicit estimates on the number of solutions of equations over a finite field
inferred← citeshttps://doi.org/10.1016/j.ffa.2017.07.002openalex-snapshot
An application of random plane slicing to counting Fq -points on hypersurfaces
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2010.01.007openalex-snapshot
Indecomposability of polynomials via Jacobian matrix
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2011.06.006openalex-snapshot
On the total order of reducibility of a pencil of algebraic plane curves
inferred← citeshttps://doi.org/10.1016/j.jco.2006.06.002openalex-snapshot
Factoring bivariate sparse (lacunary) polynomials
inferred← citeshttps://doi.org/10.1016/j.jco.2007.01.008openalex-snapshot
Lifting and recombination techniques for absolute factorization
inferred← citeshttps://doi.org/10.1016/j.jco.2025.101934openalex-snapshot
Factoring sparse polynomials fast
inferred← citeshttps://doi.org/10.1016/j.jnt.2016.06.023openalex-snapshot
Families of polynomials and their specializations
inferred← citeshttps://doi.org/10.1016/j.jsc.2007.01.003openalex-snapshot
Improved dense multivariate polynomial factorization algorithms
inferred← citeshttps://doi.org/10.1016/j.jsc.2010.06.010openalex-snapshot
Modular Las Vegas algorithms for polynomial absolute factorization
inferred← citeshttps://doi.org/10.1016/s0022-314x(03)00044-1openalex-snapshot
Irreducibility of polynomials modulo p via Newton polytopes
inferred← citeshttps://doi.org/10.1016/s0022-4049(01)00165-7openalex-snapshot
Probabilistic absolute irreducibility test for polynomials
inferred← citeshttps://doi.org/10.1016/s0747-7171(02)00011-1openalex-snapshot
Semi-numerical absolute factorization of polynomials with integer coefficients
inferred← citeshttps://doi.org/10.1017/fms.2025.10096openalex-snapshot
Improvements on dimension growth results and effective Hilbert’s irreducibility theorem
inferred← citeshttps://doi.org/10.1017/s0004972722000776openalex-snapshot
SMOOTHNESS IN PENCILS OF HYPERSURFACES OVER FINITE FIELDS
inferred← citeshttps://doi.org/10.1080/03081087.2014.910206openalex-snapshot
Typical ranks ofm×n× (m− 1)ntensors with 3 ≤m≤nover the real number field
inferred← citeshttps://doi.org/10.1088/1367-2630/12/1/013003openalex-snapshot
On photonic controlled phase gates
inferred← citeshttps://doi.org/10.1090/s0025-5718-02-01428-xopenalex-snapshot
Factoring multivariate polynomials via partial differential equations
inferred← citeshttps://doi.org/10.1090/s0025-5718-06-01878-3openalex-snapshot
Fast computation of a rational point of a variety over a finite field
inferred← citeshttps://doi.org/10.1093/imrn/rnae137openalex-snapshot
Dimension Growth for Affine Varieties
inferred← citeshttps://doi.org/10.1109/ccc.2009.18openalex-snapshot
Reconstruction of Generalized Depth-3 Arithmetic Circuits with Bounded Top Fan-in
inferred← citeshttps://doi.org/10.1109/ccc.2014.25openalex-snapshot
Equivalence of Polynomial Identity Testing and Deterministic Multivariate Polynomial Factorization
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00088openalex-snapshot
On Proximity Gaps of Reed-Solomon Codes
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00045openalex-snapshot
Fooling polynomials using invariant theory
inferred← citeshttps://doi.org/10.1109/itw.2006.1633775openalex-snapshot
Inverting bijective polynomial maps over finite fields
inferred← citeshttps://doi.org/10.1112/blms.12589openalex-snapshot
Points of bounded height on curves and the dimension growth conjecture over Fq[t]$\mathbb {F}_q[t]$
inferred← citeshttps://doi.org/10.1137/070694879openalex-snapshot
Interpolation of Depth-3 Arithmetic Circuits with Two Multiplication Gates
inferred← citeshttps://doi.org/10.1145/1060328.1060330openalex-snapshot
Towards more accurate separation bounds of empirical polynomials
inferred← citeshttps://doi.org/10.1145/1060590.1060594openalex-snapshot
Pseudorandom generators for low degree polynomials
inferred← citeshttps://doi.org/10.1145/1250790.1250833openalex-snapshot
Interpolation of depth-3 arithmetic circuits with two multiplication gates
inferred← citeshttps://doi.org/10.1145/1277500.1277503openalex-snapshot
On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms
inferred← citeshttps://doi.org/10.1145/1577190.1577199openalex-snapshot
Exact polynomial factorization by approximate high degree algebraic numbers
inferred← citeshttps://doi.org/10.1145/258533.258642openalex-snapshot
Improved low-degree testing and its applications
inferred← citeshttps://doi.org/10.1145/3717823.3718167openalex-snapshot
Primes via Zeros: Interactive Proofs for Testing Primality of Natural Classes of Ideals
inferred← citeshttps://doi.org/10.1145/384101.384121openalex-snapshot
Semi-numerical determination of irreducible branches of a reduced space curve
inferred← citeshttps://doi.org/10.1145/780506.780531openalex-snapshot
Towards certified irreducibility testing of bivariate approximate polynomials
inferred← citeshttps://doi.org/10.1145/860854.860893openalex-snapshot
On approximate irreducibility of polynomials in several variables
inferred← citeshttps://doi.org/10.2140/ant.2022.16.1941openalex-snapshot
Uniform bounds for the number of rational points on varieties over global fields
inferred← citeshttps://doi.org/10.4064/aa133-1-2openalex-snapshot
Artin's conjecture for septic and unidecic forms
inferred← citeshttps://doi.org/10.4064/aa147-3-2openalex-snapshot
Noether forms for the study of non-composite rational functions and their spectrum
inferred← citeshttps://doi.org/10.48550/arxiv.2312.17380openalex-snapshot
Factoring sparse polynomials fast
inferred← citeshttps://doi.org/10.5802/ccirm.18openalex-snapshot
Factorisation des polynômes à plusieurs variables
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.