On the public citation graph

Deterministic Polynomial Time Algorithms for Matrix Completion Problems

0 signed · 64 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/jcss.1998.1608openalex-snapshot
The Computational Complexity of Some Problems of Linear Algebra
inferredcites →https://doi.org/10.1007/3-540-09519-5_73openalex-snapshot
Probabilistic algorithms for sparse polynomials
inferredcites →https://doi.org/10.1007/978-3-642-03994-2openalex-snapshot
Matrices and Matroids for Systems Analysis
inferredcites →https://doi.org/10.1007/bf02585470openalex-snapshot
Singular spaces of matrices and their application in combinatorics
inferredcites →https://doi.org/10.1007/s00493-005-0013-7openalex-snapshot
Matroid Matching Via Mixed Skew-Symmetric Matrices
inferredcites →https://doi.org/10.1016/j.jalgebra.2008.07.014openalex-snapshot
Testing isomorphism of modules
inferredcites →https://doi.org/10.1016/j.jcss.2004.06.003openalex-snapshot
Classical complexity and quantum entanglement
inferredcites →https://doi.org/10.1016/s0022-4049(97)00010-8openalex-snapshot
Finding the radical of an algebra of linear transformations
inferredcites →https://doi.org/10.1016/s0024-3795(98)10210-0openalex-snapshot
Maximum rank matrix completion
inferredcites →https://doi.org/10.1016/s0095-8956(03)00039-xopenalex-snapshot
The linear delta-matroid parity problem
inferredcites →https://doi.org/10.1090/s0025-5718-1990-1035925-1openalex-snapshot
Computing irreducible representations of finite groups
inferredcites →https://doi.org/10.1145/22145.22162openalex-snapshot
Polynomial time solutions of some problems of computational algebra
inferredcites →https://doi.org/10.1145/258726.258751openalex-snapshot
Polynomial time algorithms for modules over finite dimensional algebras
inferredcites →https://doi.org/10.1145/322217.322225openalex-snapshot
Fast Probabilistic Algorithms for Verification of Polynomial Identities
inferredcites →https://doi.org/10.1145/322358.322373openalex-snapshot
Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs
inferredcites →https://doi.org/10.1145/3749740.3749750openalex-snapshot
Completeness Classes in Algebra
inferredcites →https://doi.org/10.1145/780542.780545openalex-snapshot
Classical deterministic complexity of Edmonds' Problem and quantum entanglement
inferredcites →https://doi.org/10.1145/780542.780595openalex-snapshot
Derandomizing polynomial identity tests means proving circuit lower bounds
inferredcites →https://doi.org/10.5555/1070432.1070499openalex-snapshot
Deterministic network coding by matrix completion
inferredcites →https://doi.org/10.5555/1109557.1109679openalex-snapshot
The complexity of matrix completion
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/978-3-030-36030-6_11openalex-snapshot
General Linear Group Action on Tensors: A Candidate for Post-quantum Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-319-22177-9_8openalex-snapshot
On the Expressive Power of Read-Once Determinants
inferred← citeshttps://doi.org/10.1007/978-3-642-22012-8_10openalex-snapshot
Algebraic Independence and Blackbox Identity Testing
inferred← citeshttps://doi.org/10.1007/978-3-642-36694-9_32openalex-snapshot
Fast Deterministic Algorithms for Matrix Completion Problems
inferred← citeshttps://doi.org/10.1007/978-3-662-48971-0_49openalex-snapshot
Polynomial-Time Isomorphism Test of Groups that are Tame Extensions
inferred← citeshttps://doi.org/10.1007/978-3-662-59204-5_12openalex-snapshot
Subspace Arrangements, Graph Rigidity and Derandomization Through Submodular Optimization
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-020-00200-zopenalex-snapshot
Linear Matroid Intersection is in Quasi-NC
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-019-09442-yopenalex-snapshot
Computing the Interleaving Distance is NP-Hard
inferred← citeshttps://doi.org/10.1007/s10623-025-01787-6openalex-snapshot
Group factorisation for smaller signatures from cryptographic group actions
inferred← citeshttps://doi.org/10.1007/s11856-023-2515-7openalex-snapshot
Connections between graphs and matrix spaces
inferred← citeshttps://doi.org/10.1016/j.aam.2011.04.006openalex-snapshot
Spanning trees of 3-uniform hypergraphs
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2013.12.001openalex-snapshot
On the normal forms of modules with respect to parametrizing bimodules
inferred← citeshttps://doi.org/10.1016/j.jcss.2015.04.006openalex-snapshot
Generalized Wong sequences and their applications to Edmonds' problems
inferred← citeshttps://doi.org/10.1016/j.jpaa.2017.02.008openalex-snapshot
On the complexity of the permanent in various computational models
inferred← citeshttps://doi.org/10.1109/focs.2016.95openalex-snapshot
A Deterministic Polynomial Time Algorithm for Non-commutative Rational Identity Testing
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00054openalex-snapshot
Canonical Forms for Matrix Tuples in Polynomial Time
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00090openalex-snapshot
Faster Isomorphism Testing of $p$-Groups of Frattini Class 2
inferred← citeshttps://doi.org/10.1109/isit.2011.6034157openalex-snapshot
Deterministic algorithm for the cooperative data exchange problem
inferred← citeshttps://doi.org/10.1137/1.9781611975031.152openalex-snapshot
Algorithms Based on *-Algebras, and Their Applications to Isomorphism of Polynomials with One Secret, Group Isomorphism, and Polynomial Identity Testing
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/130909214openalex-snapshot
Fast Deterministic Algorithms for Matrix Completion Problems
inferred← citeshttps://doi.org/10.1137/130910725openalex-snapshot
Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-$D$ Occur-$k$ Formulas and Depth-3 Transcendence Degree-$k$ Circuits
inferred← citeshttps://doi.org/10.1137/15m1009767openalex-snapshot
Algorithms for Group Isomorphism via Group Extensions and Cohomology
inferred← citeshttps://doi.org/10.1137/18m1190823openalex-snapshot
Computing the Degree of Determinants via Discrete Convex Optimization on Euclidean Buildings
inferred← citeshttps://doi.org/10.1137/21m1441110openalex-snapshot
On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness
inferred← citeshttps://doi.org/10.1137/24m1719839openalex-snapshot
Faster Isomorphism Testing of p -Groups of Frattini Class 2
inferred← citeshttps://doi.org/10.1145/2213977.2214033openalex-snapshot
Jacobian hits circuits
inferred← citeshttps://doi.org/10.1145/3188745.3188942openalex-snapshot
Operator scaling via geodesically convex optimization, invariant theory and polynomial identity testing
inferred← citeshttps://doi.org/10.1145/3625308openalex-snapshot
On p -Group Isomorphism: Search-to-Decision, Counting-to-Decision, and Nilpotency Class Reductions via Tensors
inferred← citeshttps://doi.org/10.1145/3665800openalex-snapshot
Hitting Sets for Orbits of Circuit Classes and Polynomial Families
inferred← citeshttps://doi.org/10.1145/3666000.3669685openalex-snapshot
Structural Preprocessing Method for Nonlinear Differential-Algebraic Equations Using Linear Symbolic Matrices
inferred← citeshttps://doi.org/10.1145/3717823.3718146openalex-snapshot
Characterizing and Testing Principal Minor Equivalence of Matrices
inferred← citeshttps://doi.org/10.3934/math.2025417openalex-snapshot
Completion problems of partial $ N_0^1 $-matrices under directed 2-trees
inferred← citeshttps://doi.org/10.4086/toc.2018.v014a003openalex-snapshot
inferred← citeshttps://doi.org/10.4204/eptcs.406.6openalex-snapshot
Pauli Flow on Open Graphs with Unknown Measurement Labels
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2021.16openalex-snapshot
Isomorphism problems for tensors, groups, and cubic forms: completeness and reductions
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2016.34openalex-snapshot
Boundaries of VP and VNP
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2025.53openalex-snapshot
On Read-k Projections of the Determinant
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.1512.08365openalex-snapshot
The Module Isomorphism Problem for Finite Rings and Related Results
inferred← citeshttps://doi.org/10.70675/a109e979z974dz4ec6zb353z67e1a2526c54openalex-snapshot
Algorithms for finite rings
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.