Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ http://arxiv.org/pdf...arrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
http://arxiv.org/pdf/1803.0663...
Article
Data sources: UnpayWall
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
arXiv.org e-Print Archive
Preprint . 2018
Data sources: arXiv.org e-Print Archive
https://doi.org/10.1142/978981...
Article . 2019 . Peer-reviewed
Data sources: Crossref
https://dx.doi.org/10.48550/ar...
Article . 2018
License: arXiv Non-Exclusive Distribution
Data sources: Datacite
https://dx.doi.org/10.1142/978...
Other literature type
Data sources: Microsoft Academic Graph
 View all 3 versions
Claim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

COMPLEXITY PROBLEMS IN ENUMERATIVE COMBINATORICS

descriptionPublicationkeyboard_double_arrow_right Article , Preprint , Other literature type 01 May 2019Embargo end date: 01 Jan 2018Publisher:World Scientific Pub Co Pte LtdJournal:Proceedings of the International Congress of Mathematicians (ICM 2018)
Authors: Pak, Igor;

doi: 10.1142/9789813272880_0176 , 10.48550/arxiv.1803.06636

arXiv: 1803.06636

COMPLEXITY PROBLEMS IN ENUMERATIVE COMBINATORICS

Abstract

We give a broad survey of recent results in Enumerative Combinatorics and their complexity aspects.

31 pages; an expanded version of the ICM 2018 paper (Section 4 added, refs expanded)

Related Organizations
Keywords

FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Mathematics - History and Overview, History and Overview (math.HO), Probability (math.PR), Computational Complexity (cs.CC), Computer Science - Computational Complexity, FOS: Mathematics, 05A, Mathematics - Combinatorics, Combinatorics (math.CO), Mathematics - Probability, Computer Science - Discrete Mathematics

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    		 2
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    		 Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    		 Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    		 Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
2
Average
Average
Average
Green