Computational complexity, Newton polytopes, and Schubert polynomials

Keyphrases

• Computational Complexity 100%
• Non-vanishing 100%
• Schubert Polynomials 100%
• Newton Polytope 100%
• Algebraic Combinatorics 66%
• New Characterization 33%
• Polynomial-time Algorithm 33%
• Complexity Classes 33%
• Complexity Theory 33%
• Quality Characterization 33%
• Counting Rule 33%
• Cohomology Ring 33%
• Tableau 33%
• Flag Manifolds 33%
• Family of Polynomials 33%
• Combinatorial Counting 33%
• Permutahedron 33%
• NP Class 33%
• Coefficients of a Polynomial 33%

Mathematics

• Polynomial 100%
• Polytope 100%
• Algebraic Combinatorics 40%
• Polynomial Time 20%
• Manifold 20%
• Homology 20%