Pages that link to "Item:Q2784468"

The following pages link to Geometric complexity theory. I: An approach to the P vs. NP and related problems (Q2784468):

Displaying 50 items.

• The boundary of the orbit of the 3-by-3 determinant polynomial (Q309769) (← links)
• A diagrammatic approach to Kronecker squares (Q406574) (← links)
• Geometric complexity theory. III: On deciding nonvanishing of a Littlewood-Richardson coefficient (Q438742) (← links)
• Eigenvalue distributions of reduced density matrices (Q461414) (← links)
• Generalized counting constraint satisfaction problems with determinantal circuits (Q472444) (← links)
• Plethysm and lattice point counting (Q515986) (← links)
• Fundamental invariants of orbit closures (Q517074) (← links)
• Even partitions in plethysms. (Q536182) (← links)
• Nonvanishing of Kronecker coefficients for rectangular shapes. (Q549219) (← links)
• \(P\) versus \(NP\) and geometry (Q607059) (← links)
• An introduction to geometric complexity theory (Q737196) (← links)
• A geometric approach to the Kronecker problem. I: The two row case. (Q943027) (← links)
• Geometric complexity theory and matrix powering (Q1679673) (← links)
• Permanent v. determinant: an exponential lower bound assuming symmetry and a potential path towards Valiant's conjecture (Q1679675) (← links)
• Holographic algorithms beyond matchgates (Q1706145) (← links)
• Complexity classes and completeness in algebraic geometry (Q1740570) (← links)
• Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via operator scaling (Q1746610) (← links)
• Obstructions to combinatorial formulas for plethysm (Q1753006) (← links)
• On the complexity of the permanent in various computational models (Q2013543) (← links)
• Blackbox identity testing for sum of special ROABPs and its border class (Q2041244) (← links)
• Singular tuples of matrices is not a null cone (and the symmetries of algebraic varieties) (Q2054204) (← links)
• Integrality, duality and finiteness in combinatoric topological strings (Q2087861) (← links)
• A note on VNP-completeness and border complexity (Q2122788) (← links)
• Vanishing symmetric Kronecker coefficients (Q2181688) (← links)
• Generalized Littlewood-Richardson coefficients for branching rules of \(\mathrm{GL}(n)\) and extremal weight crystals (Q2219301) (← links)
• Linear projections of the Vandermonde polynomial (Q2330107) (← links)
• Connections between conjectures of Alon-Tarsi, Hadamard-Howe, and integrals over the special unitary group (Q2339440) (← links)
• A complexity theory of constructible functions and sheaves (Q2340508) (← links)
• Kronecker coefficients for some near-rectangular partitions (Q2341312) (← links)
• Geometric complexity theory: an introduction for geometers (Q2346304) (← links)
• Two orbits: when is one in the closure of the other? (Q2347511) (← links)
• Polynomial-time algorithms for quadratic isomorphism of polynomials: the regular case (Q2349096) (← links)
• Unifying known lower bounds via geometric complexity theory (Q2351393) (← links)
• The Saxl conjecture and the dominance order (Q2352062) (← links)
• Rectangular Kronecker coefficients and plethysms in geometric complexity theory (Q2404629) (← links)
• Lower bounds for the circuit size of partially homogeneous polynomials (Q2405138) (← links)
• Non-commutative Edmonds' problem and matrix semi-invariants (Q2410690) (← links)
• Cocharacter-closure and the rational Hilbert-Mumford theorem (Q2412524) (← links)
• The graph isomorphism problem and approximate categories (Q2437326) (← links)
• Algebraic geometry and representation theory in the study of matrix multiplication complexity and other problems in theoretical computer science (Q2672320) (← links)
• Ranks of linear matrix pencils separate simultaneous similarity orbits (Q2684535) (← links)
• Geometric complexity theory. V: Efficient algorithms for Noether normalization (Q2826783) (← links)
• Torsion points and matrices defining elliptic curves (Q2934270) (← links)
• SIMPLE GROUPS STABILIZING POLYNOMIALS (Q2941124) (← links)
• Permanent versus determinant: Not via saturations (Q2951164) (← links)
• On P vs. NP and geometric complexity theory (Q3016252) (← links)
• (Q3096713) (← links)
• On Geometric Complexity Theory: Multiplicity Obstructions Are Stronger Than Occurrence Obstructions (Q3295878) (← links)
• NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs (Q4386448) (← links)
• Orthogonal tensor decomposition and orbit closures from a linear algebraic perspective (Q4959316) (← links)