Fetching the paper…
Reading the bibliography…
An action of a group on a vector space partitions the latter into a set of orbits.
The Classical Groups. Their Invariants and Representations
Hermann Weyl · 1939
Earlier work this paper cites.
A relationship between arbitrary positive matrices and doubly stochastic matrices
R. Sinkhorn · 1964
Earlier work this paper cites.
The complexity of theorem proving procedures
Stephen A. Cook · 1971
Earlier work this paper cites.
Reducibility among combinatorial problems
Richard M. Karp · 1972
Earlier work this paper cites.
Universal enumeration problems
L. A. Levin · 1973
Earlier work this paper cites.
Linear algebraic groups
James E. Humphreys · 1975
Earlier work this paper cites.
Polynomial algorithms for computing the Smith and Hermite normal forms of an integer matrix
Ravindran Kannan and Achim Bachem · 1979
Earlier work this paper cites.
The length of vectors in representation spaces
George Kempf and Linda Ness · 1979
Earlier work this paper cites.
Geometrische Methoden in der Invariantentheorie
Hanspeter Kraft · 1984
Earlier work this paper cites.
Theory of linear and integer programming
Alexander Schrijver · 1986
Earlier work this paper cites.
The red book of varieties and schemes
David Mumford · 1988
Earlier work this paper cites.
Factor refinement
Eric Bach, James R. Driscoll, and Jeffrey O. Shallit · 1990
Earlier work this paper cites.
Symplectic techniques in physics
Victor Guillemin and Shlomo Sternberg · 1990
Earlier work this paper cites.
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
Charles H Bennett, Gilles Brassard, Claude Crépeau, Richard Jozsa, Asher Peres, and William K Wootters · 1993
Earlier work this paper cites.
Testing equalities of multiplicative representations in polynomial time (extended abstract)
Guoqiang Ge · 1993
Earlier work this paper cites.
Geometric algorithms and combinatorial optimization
Martin Grötschel, László Lovász, and Alexander Schrijver · 1993
Earlier work this paper cites.
Constructive invariant theory for tori
David Wehlau · 1993
Earlier work this paper cites.
Geometric invariant theory, Third Edition
David Mumford, John Fogarty, and Frances Kirwan · 1994
Earlier work this paper cites.
Ideals, varieties, and algorithms - an introduction to computational algebraic geometry and commutative algebra (2. ed.)
David A. Cox, John Little, and Donal O’Shea · 1997
Earlier work this paper cites.
Marriage, magic, and solitaire
David B Leep and Gerry Myerson · 1999
Earlier work this paper cites.
A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
Nathan Linial, Alex Samorodnitsky, and Avi Wigderson · 2000
Cited alongside, same era.
Polynomial bounds for rings of invariants
Harm Derksen · 2001
Cited alongside, same era.
Geometric complexity theory I: An approach to the P vs. NP and related problems
Ketan D Mulmuley and Milind Sohoni · 2001
Cited alongside, same era.
On the complexity of recognizing the Hilbert basis of a linear Diophantine system
Arnaud Durand, Miki Hermann, and Laurent Juban · 2002
Cited alongside, same era.
Lectures on invariant theory
Igor Dolgachev · 2003
Cited alongside, same era.
Classical complexity and quantum entanglement
Leonid Gurvits · 2004
Cited alongside, same era.
Matrix scaling and balancing via box constrained Newton’s method and interior point methods
Michael B Cohen, Aleksander Madry, Dimitris Tsipras, and Adrian Vladu · 2017
Later among the works it cites.
Generating invariant rings of quivers in arbitrary characteristic
Harm Derksen and Visu Makam · 2017
Later among the works it cites.
Polynomial degree bounds for matrix semi-invariants
Harm Derksen and Visu Makam · 2017
Later among the works it cites.
On vanishing of Kronecker coefficients
Christian Ikenmeyer, Ketan D Mulmuley, and Michael Walter · 2017
Later among the works it cites.
Non-commutative Edmonds’ problem and matrix semi-invariants
Gábor Ivanyos, Youming Qiao, and K. V. Subrahmanyam · 2017
Later among the works it cites.
Geometric complexity theory V: Efficient algorithms for Noether normalization
Ketan D. Mulmuley · 2017
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Combinatorial and algorithmic aspects of hyperbolic polynomials
Leonid Gurvits · 2004
Cited alongside, same era.
Derandomizing polynomial identity tests means proving circuit lower bounds
Valentine Kabanets and Russell Impagliazzo · 2004
Cited alongside, same era.
Testing isomorphism of modules
Peter A. Brooksbank and Eugene M. Luks · 2008
Cited alongside, same era.
Algorithms in Invariant Theory
Bernd Sturmfels · 2008
Cited alongside, same era.
Two orbits: When is one in the closure of the other?
Vladimir L Popov · 2009
Cited alongside, same era.
Torus actions on symplectic manifolds
Michele Audin · 2012
Cited alongside, same era.
Later among the works it cites.
Operator scaling via geodesically convex optimization, invariant theory and polynomial identity testing
Zeyuan Allen-Zhu, Ankit Garg, Yuanzhi Li, Rafael Oliveira, and Avi Wigderson · 2018
Later among the works it cites.
Efficient algorithms for tensor scaling, quantum marginals, and moment polytopes
Peter Bürgisser, Cole Franks, Ankit Garg, Rafael Oliveira, Michael Walter, and Avi Wigderson · 2018
Later among the works it cites.
Alternating minimization, scaling algorithms, and the null-cone problem from invariant theory
Peter Bürgisser, Ankit Garg, Rafael Oliveira, Michael Walter, and Avi Wigderson · 2018
Later among the works it cites.
Degree bounds for semi-invariant rings of quivers
Harm Derksen and Visu Makam · 2018
Later among the works it cites.
Constructive non-commutative rank computation is in deterministic polynomial time
Gábor Ivanyos, Youming Qiao, and K. V. Subrahmanyam · 2018
Later among the works it cites.
Towards a theory of non-commutative optimization: geodesic first and second order methods for moment maps and polytopes
Peter Bürgisser, Cole Franks, Ankit Garg, Rafael Mendes de Oliveira, Michael Walter, and Avi Wigderson · 2019
Later among the works it cites.
Singular tuples of matrices is not a null cone (and, the symmetries of algebraic varieties)
Visu Makam and Avi Wigderson · 2019
Later among the works it cites.
Variety membership testing, algebraic natural proofs, and geometric complexity theory
Markus Bläser, Christian Ikenmeyer, Vladimir Lysikov, Anurag Pandey, and Frank-Olaf Schreyer · 2020
Later among the works it cites.
Interior-point methods for unconstrained geometric programming and scaling problems
Peter Bürgisser, Yinan Li, Harold Nieuwboer, and Michael Walter · 2020
Later among the works it cites.
Algorithms for orbit closure separation for invariants and semi-invariants of matrices
Harm Derksen and Visu Makam · 2020
Later among the works it cites.
An exponential lower bound for the degrees of invariants of cubic forms and tensor actions
Harm Derksen and Visu Makam · 2020
Later among the works it cites.
Operator scaling: theory and applications
Ankit Garg, Leonid Gurvits, Rafael Oliveira, and Avi Wigderson · 2020
Later among the works it cites.
Search problems in algebraic complexity, GCT, and hardness of generators for invariant rings
Ankit Garg, Christian Ikenmeyer, Visu Makam, Rafael Mendes de Oliveira, Michael Walter, and Avi Wigderson · 2020
Later among the works it cites.