Related papers: Complexity problems in enumerative combinatorics
We survey results on the hardness of approximating combinatorial optimization problems.
In this paper, we enumerate enumeration problems and algorithms. This survey is under construction. If you know some results not in this survey or there is anything wrong, please let me know.
In this survey paper we discuss some recent results and related open questions in additive combinatorics, in particular, questions about sumsets in finite abelian groups.
This habilitation thesis is intended to be a good introduction to enumeration, the problem of listing solutions. It focuses on the different ways of measuring complexity in enumeration, with a particular emphasis on my contributions to the…
This is a survey of old and new problems and results in additive number theory.
We give a review of modern approaches to constructing formal solutions to integrable hierarchies of mathematical physics, whose coefficients are answers to various enumerative problems. The relationship between these approaches and…
Complexity theory provides a wealth of complexity classes for analyzing the complexity of decision and counting problems. Despite the practical relevance of enumeration problems, the tools provided by complexity theory for this important…
As suggested by the title, this paper is a survey of recent results and questions on the collection of computably enumerable sets under inclusion. This is not a broad survey but one focused on the author's and a few others' current…
A survey written for the upcoming "Handbook of Enumerative Combinatorics".
A partly autobiographical survey of the development of enumerative and algebraic combinatorics in the 1960's and 1970's.
In this survey we discuss the notion of combinatorial interpretation in the context of Algebraic Combinatorics and related areas. We approach the subject from the Computational Complexity perspective. We review many examples, state a…
This paper surveys the recent attempts at leveraging machine learning to solve constrained optimization problems. It focuses on surveying the work on integrating combinatorial solvers and optimization methods with machine learning…
We provide an overview of some recent progress on the complexity of election systems. The issues studied include the complexity of the winner, manipulation, bribery, and control problems.
We discuss recent progress many problems in random matrix theory of a combinatorial nature, including several breakthroughs that solve long standing famous conjectures.
The paper focuses on some versions of connected dominating set problems: basic problems and multicriteria problems. A literature survey on basic problem formulations and solving approaches is presented. The basic connected dominating set…
Extremal Combinatorics is among the most active topics in Discrete Mathematics, dealing with problems that are often motivated by questions in other areas, including Theoretical Computer Science and Information Theory. This paper contains a…
We discuss the use of methods coming from integrable systems to study problems of enumerative and algebraic combinatorics, and develop two examples: the enumeration of Alternating Sign Matrices and related combinatorial objects, and the…
Symmetry is a common feature of many combinatorial problems. Unfortunately eliminating all symmetry from a problem is often computationally intractable. This paper argues that recent parameterized complexity results provide insight into…
We point out four problems which have arisen during the recent research in the domain of Combinatorial Physics.
In this paper we provide an overview of a series of recent results regarding algorithms for searching for subsequences in words or for the analysis of the sets of subsequences occurring in a word.