On the public citation graph
A Deterministic Polynomial Time Algorithm for Non-commutative Rational Identity Testing
0 signed · 112 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 this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/eujc.2002.0573openalex-snapshot
Spaces of Singular Matrices and Matroid Parity
inferredcites →https://doi.org/10.1007/3-540-09519-5_73openalex-snapshot
Probabilistic algorithms for sparse polynomials
inferredcites →https://doi.org/10.1007/978-0-387-35651-8openalex-snapshot
Ideals, Varieties, and Algorithms
inferredcites →https://doi.org/10.1007/978-3-642-40328-6_37openalex-snapshot
Explicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity Testing
inferredcites →https://doi.org/10.1007/978-3-642-52012-9_19openalex-snapshot
Über die vollen Invariantensysteme
inferredcites →https://doi.org/10.1007/978-3-662-04958-7openalex-snapshot
Computational Invariant Theory
inferredcites →https://doi.org/10.1007/bf01236060openalex-snapshot
Semi-invariants of quivers as determinants
inferredcites →https://doi.org/10.1007/bf01444162openalex-snapshot
Ueber die vollen Invariantensysteme
inferredcites →https://doi.org/10.1007/bf02038756openalex-snapshot
Sur une généralisation du groupe orthogonal à quatre variables
inferredcites →https://doi.org/10.1007/bf02559591openalex-snapshot
Theorie der Normalflächen: Ein Isotopiekriterium für den Kreisknoten
inferredcites →https://doi.org/10.1007/bfb0076314openalex-snapshot
Generating the ring of matrix invariants
inferredcites →https://doi.org/10.1007/s00037-004-0182-6openalex-snapshot
Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds
inferredcites →https://doi.org/10.1007/s00037-005-0188-8openalex-snapshot
Deterministic polynomial identity testing in non-commutative models
inferredcites →https://doi.org/10.1007/s00037-007-0226-9openalex-snapshot
Polynomial Identity Testing for Depth 3 Circuits
inferredcites →https://doi.org/10.1007/s00037-016-0143-xopenalex-snapshot
Non-commutative Edmonds’ problem and matrix semi-invariants
inferredcites →https://doi.org/10.1007/s00493-016-3460-4openalex-snapshot
Black-Box Identity Testing of Depth-4 Multilinear Circuits
inferredcites →https://doi.org/10.1007/s004930070031openalex-snapshot
An Algebraic Matching Algorithm
inferredcites →https://doi.org/10.1016/0001-8708(76)90027-xopenalex-snapshot
The invariant theory of n × n matrices
inferredcites →https://doi.org/10.1016/0001-8708(88)90054-0openalex-snapshot
Vector spaces of matrices of low rank
inferredcites →https://doi.org/10.1016/0021-8693(66)90004-4openalex-snapshot
Rational identities and applications to algebra and geometry
inferredcites →https://doi.org/10.1016/0304-3975(79)90044-6openalex-snapshot
The Complexity of Computing the Permanent
inferredcites →https://doi.org/10.1016/j.aim.2017.01.018openalex-snapshot
Polynomial degree bounds for matrix semi-invariants
inferredcites →https://doi.org/10.1016/j.jcss.2004.06.003openalex-snapshot
Classical complexity and quantum entanglement
inferredcites →https://doi.org/10.1016/s0019-3577(01)80010-0openalex-snapshot
Semi-invariants of quivers for arbitrary dimension vectors
inferredcites →https://doi.org/10.1070/im1974v008n04abeh002126openalex-snapshot
TRACE IDENTITIES OF FULL MATRIX ALGEBRAS OVER A FIELD OF CHARACTERISTIC ZERO
inferredcites →https://doi.org/10.1070/im1982v019n02abeh001422openalex-snapshot
THE CONSTRUCTIVE THEORY OF INVARIANTS
inferredcites →https://doi.org/10.1090/s0002-9939-00-05698-7openalex-snapshot
Polynomial bounds for rings of invariants
inferredcites →https://doi.org/10.1090/s0894-0347-00-00331-3openalex-snapshot
Semi-invariants of quivers and saturation for Littlewood-Richardson coefficients
inferredcites →https://doi.org/10.1093/qmath/31.3.253openalex-snapshot
LARGE SPACES OF MATRICES OF BOUNDED RANK
inferredcites →https://doi.org/10.1109/focs.2012.15openalex-snapshot
Geometric Complexity Theory V: Equivalence between Blackbox Derandomization of Polynomial Identity Testing and Derandomization of Noether's Normalization Lemma
inferredcites →https://doi.org/10.1109/focs.2013.34openalex-snapshot
Quasipolynomial-Time Identity Testing of Non-commutative and Read-Once Oblivious Algebraic Branching Programs
inferredcites →https://doi.org/10.1112/blms/12.2.89openalex-snapshot
Spaces of Matrices with Several Zero Eigenvalues
inferredcites →https://doi.org/10.1112/plms/s3-23.2.193openalex-snapshot
The Embedding of Firs in Skew Fields
inferredcites →https://doi.org/10.1137/05063605xopenalex-snapshot
Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits
inferredcites →https://doi.org/10.1137/090781231openalex-snapshot
Deterministic Polynomial Time Algorithms for Matrix Completion Problems
inferredcites →https://doi.org/10.1137/16m1097870openalex-snapshot
Bipartite Perfect Matching is in Quasi-NC
inferredcites →https://doi.org/10.1142/s0218196799000205openalex-snapshot
ON THE CONSTRUCTION OF THE FREE FIELD
inferredcites →https://doi.org/10.1145/1060590.1060678openalex-snapshot
Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits
inferredcites →https://doi.org/10.1145/2554797.2554805openalex-snapshot
Non-commutative arithmetic circuits with division
inferredcites →https://doi.org/10.1145/276698.276880openalex-snapshot
A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
inferredcites →https://doi.org/10.1145/2897518.2897564openalex-snapshot
Bipartite perfect matching is in quasi-NC
inferredcites →https://doi.org/10.1145/322217.322225openalex-snapshot
Fast Probabilistic Algorithms for Verification of Polynomial Identities
inferredcites →https://doi.org/10.1145/3749740.3749750openalex-snapshot
Completeness Classes in Algebra
inferredcites →https://doi.org/10.1145/380752.380801openalex-snapshot
Randomness efficient identity testing of multivariate polynomials
inferredcites →https://doi.org/10.1214/aoms/1177703591openalex-snapshot
A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices
inferredcites →https://doi.org/10.1561/0400000039openalex-snapshot
Arithmetic Circuits: A Survey of Recent Results and Open Questions
inferredcites →https://doi.org/10.2307/1969933openalex-snapshot
Recursive Unsolvability of Group Theoretic Problems
inferredcites →https://doi.org/10.2307/2272273openalex-snapshot
The word problem for free fields: a correction and an addendum
inferredcites →https://doi.org/10.6028/jres.071b.033openalex-snapshot
Systems of distinct representatives and linear algebra
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s00031-020-09559-3openalex-snapshot
WEYL’S POLARIZATION THEOREM IN POSITIVE CHARACTERISTIC
inferred← citeshttps://doi.org/10.1007/s00037-016-0143-xopenalex-snapshot
Non-commutative Edmonds’ problem and matrix semi-invariants
inferred← citeshttps://doi.org/10.1007/s00037-018-0165-7openalex-snapshot
Constructive non-commutative rank computation is in deterministic polynomial time
inferred← citeshttps://doi.org/10.1007/s00039-018-0434-2openalex-snapshot
Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via Operator Scaling
inferred← citeshttps://doi.org/10.1007/s00220-017-3077-5openalex-snapshot
Tripartite-to-Bipartite Entanglement Transformation by Stochastic Local Operations and Classical Communication and the Structure of Matrix Spaces
inferred← citeshttps://doi.org/10.1007/s10208-018-9386-zopenalex-snapshot
Learning Semidefinite Regularizers
inferred← citeshttps://doi.org/10.1007/s10208-020-09465-wopenalex-snapshot
Noncommutative Polynomials Describing Convex Sets
inferred← citeshttps://doi.org/10.1007/s10208-024-09684-5openalex-snapshot
Computing the Noncommutative Inner Rank by Means of Operator-Valued Free Probability Theory
inferred← citeshttps://doi.org/10.1007/s10208-026-09756-8openalex-snapshot
Interior-Point Methods on Manifolds: Theory and Applications
inferred← citeshttps://doi.org/10.1007/s11005-019-01169-9openalex-snapshot
Sinkhorn–Knopp theorem for PPT states
inferred← citeshttps://doi.org/10.1007/s11856-021-2245-7openalex-snapshot
The Paulsen problem made simple
inferred← citeshttps://doi.org/10.1016/j.aim.2023.108888openalex-snapshot
Ranks of linear matrix pencils separate simultaneous similarity orbits
inferred← citeshttps://doi.org/10.1016/j.difgeo.2017.08.002openalex-snapshot
On rank-critical matrix spaces
inferred← citeshttps://doi.org/10.1016/j.jfa.2023.110016openalex-snapshot
The free field: Realization via unbounded operators and Atiyah property
inferred← citeshttps://doi.org/10.1016/j.jpaa.2019.106220openalex-snapshot
Characteristic free description of semi-invariants of 2 × 2 matrices
inferred← citeshttps://doi.org/10.1016/j.laa.2019.05.004openalex-snapshot
Matrix scaling and explicit doubly stochastic limits
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.07.005openalex-snapshot
Derandomization and absolute reconstruction for sums of powers of linear forms
inferred← citeshttps://doi.org/10.1017/fms.2022.37openalex-snapshot
Maximum likelihood estimation for tensor normal models via castling transforms
inferred← citeshttps://doi.org/10.1017/s0963548321000122openalex-snapshot
Counting matchings via capacity-preserving operators
inferred← citeshttps://doi.org/10.1109/focs.2017.49openalex-snapshot
Linear Algebraic Analogues of the Graph Isomorphism Problem and the Erdős-Rényi Model
inferred← citeshttps://doi.org/10.1109/focs.2018.00088openalex-snapshot
Efficient Algorithms for Tensor Scaling, Quantum Marginals, and Moment Polytopes
inferred← citeshttps://doi.org/10.1109/focs.2019.00055openalex-snapshot
Towards a Theory of Non-Commutative Optimization: Geodesic 1st and 2nd Order Methods for Moment Maps and Polytopes
inferred← citeshttps://doi.org/10.1109/focs.2019.00074openalex-snapshot
Spectral Analysis of Matrix Scaling and Operator Scaling
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00086openalex-snapshot
Symbolic determinant identity testing (SDIT) is not a null cone problem; and the symmetries of algebraic varieties
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00026openalex-snapshot
Separated borders: Exponential-gap fanin-hierarchy theorem for approximative depth-3 circuits
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00027openalex-snapshot
The minimal canonical form of a tensor network
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00123openalex-snapshot
Interior-point methods on manifolds: theory and applications
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00042openalex-snapshot
Trading Determinism for Noncommutativity in Edmonds' Problem
inferred← citeshttps://doi.org/10.1112/blms.12049openalex-snapshot
Behaviour of the Brascamp–Lieb constant
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch158openalex-snapshot
On the orbit closure intersection problems for matrix tuples under conjugation and left-right actions
inferred← citeshttps://doi.org/10.1137/24m1661753openalex-snapshot
A Bridge between Invariant Theory and Maximum Likelihood Estimation
inferred← citeshttps://doi.org/10.1145/3055399.3055458openalex-snapshot
Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via operator scaling
inferred← citeshttps://doi.org/10.1145/3188745.3188794openalex-snapshot
The Paulsen problem, continuous operator scaling, and smoothed analysis
inferred← citeshttps://doi.org/10.1145/3188745.3188932openalex-snapshot
Operator scaling with specified marginals
inferred← citeshttps://doi.org/10.1145/3406325.3451105openalex-snapshot
Capacity lower bounds via productization
inferred← citeshttps://doi.org/10.1145/3476446.3535489openalex-snapshot
Non-commutative Optimization - Where Algebra, Analysis and Computational Complexity Meet
inferred← citeshttps://doi.org/10.1145/3564246.3585128openalex-snapshot
Generic Reed-Solomon Codes Achieve List-Decoding Capacity
inferred← citeshttps://doi.org/10.1145/3618260.3649693openalex-snapshot
Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time
inferred← citeshttps://doi.org/10.1515/crelle-2021-0044openalex-snapshot
Singular tuples of matrices is not a null cone (and the symmetries of algebraic varieties)
inferred← citeshttps://doi.org/10.1515/math-2020-0076openalex-snapshot
A standard form in (some) free fields: How to construct minimal linear representations
inferred← citeshttps://doi.org/10.2140/ant.2020.14.2791openalex-snapshot
Algorithms for orbit closure separation for invariants and semi-invariants of matrices
inferred← citeshttps://doi.org/10.22028/d291-47560openalex-snapshot
A Deterministic PTAS for the Algebraic Rank of Bounded Degree Polynomials
inferred← citeshttps://doi.org/10.4171/dm/780openalex-snapshot
The Dyson Equation with Linear Self-Energy: Spectral Bands, Edges and Cusps
inferred← citeshttps://doi.org/10.4171/jca/66openalex-snapshot
Polystability in positive characteristic and degree lower bounds for invariant rings
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2020.12openalex-snapshot
Search Problems in Algebraic Complexity, GCT, and Hardness of Generators for Invariant Rings
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2021.32openalex-snapshot
Polynomial Time Algorithms in Invariant Theory for Torus Actions
inferred← citeshttps://doi.org/10.48550/arxiv.1512.03531openalex-snapshot
Constructive noncommutative rank computation is in deterministic polynomial time
inferred← citeshttps://doi.org/10.48550/arxiv.1609.06349openalex-snapshot
A review of matrix scaling and Sinkhorn's normal form for matrices and positive maps
inferred← citeshttps://doi.org/10.48550/arxiv.1702.07180openalex-snapshot
Small hitting-sets for tiny arithmetic circuits or: How to turn bad designs into good
inferred← citeshttps://doi.org/10.48550/arxiv.1805.04150openalex-snapshot
The free field: zero divisors, Atiyah property and realizations via unbounded operators
inferred← citeshttps://doi.org/10.48550/arxiv.1806.06373openalex-snapshot
Geodesic Convex Optimization: Differentiation on Manifolds, Geodesics, and Convexity
inferred← citeshttps://doi.org/10.48550/arxiv.1807.03663openalex-snapshot
Orbits of monomials and factorization into products of linear forms
inferred← citeshttps://doi.org/10.48550/arxiv.1902.04544openalex-snapshot
Matrix scaling, explicit Sinkhorn limits, and arithmetic
inferred← citeshttps://doi.org/10.48550/arxiv.1904.03950openalex-snapshot
From independent sets and vertex colorings to isotropic spaces and isotropic decompositions
inferred← citeshttps://doi.org/10.48550/arxiv.1905.09426openalex-snapshot
Matrix scaling and explicit doubly stochastic limits
inferred← citeshttps://doi.org/10.48550/arxiv.1907.04512openalex-snapshot
Computing Valuations of the Dieudonné Determinants
inferred← citeshttps://doi.org/10.48550/arxiv.2002.00071openalex-snapshot
Rigorous Guarantees for Tyler's M-estimator via quantum expansion
inferred← citeshttps://doi.org/10.48550/arxiv.2011.01851openalex-snapshot
On the Computability of Continuous Maximum Entropy Distributions: Adjoint Orbits of Lie Groups
inferred← citeshttps://doi.org/10.48550/arxiv.2109.01080openalex-snapshot
Optimization and Sampling Under Continuous Symmetry: Examples and Lie Theory
inferred← citeshttps://doi.org/10.7282/t3-1k1c-8h60openalex-snapshot
A simple algorithm for Horn's problem and two results on discrepancy
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.