Computational complexity, Newton polytopes, and Schubert polynomials
type: Item
instance of: scholarly article
title: Computational complexity, Newton polytopes, and Schubert polynomials
zbMATH Open document ID: 1436.05115
author: Anshul Adve
author: Robichaux Colleen
author: Yong Alexander
published in: Séminaire Lotharingien de Combinatoire
publication date: 2020-03-23T00:00:00Z
full work available at URL: https://arxiv.org/abs/1810.10361
full work available at URL: 52.html
Mathematics Subject Classification ID: 05E10
Mathematics Subject Classification ID: 05E05
Mathematics Subject Classification ID: 05A15
Mathematics Subject Classification ID: 14M15
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 7181259
zbMATH Keywords: Schubert polynomials
zbMATH Keywords: Newton polytopes
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
arXiv ID: 1810.10361
cites work: PRIMES is in P
cites work: Lattice problems in NP ∩ coNP
cites work: Some combinatorial properties of Schubert polynomials
cites work: The complexity of stochastic games
cites work: Schubert polynomials as integer point transforms of generalized permutahedra
cites work: Balanced labellings and Schubert polynomials
cites work: Q3129746
cites work: P, NP, and NP-Completeness
cites work: The NP-Completeness of Some Edge-Partition Problems
cites work: Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
cites work: Q3958580
cites work: Newton polytopes in algebraic combinatorics
cites work: Every Prime Has a Succinct Certificate
cites work: Q3818127
cites work: A symmetric function generalization of the chromatic polynomial of a graph
description: scientific article