A complexity theory for hard enumeration problems
نویسندگان
چکیده
منابع مشابه
On the Complexity of Hard Enumeration Problems
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 class of problems are very limited. In particular, complexity classes analogous to the polynomial hierarchy and an appropriate notion of problem reduction are ...
متن کاملComplexity of Some Polyhedral Enumeration Problems
In this thesis we consider the problem of converting the halfspace representation of a polytope to its vertex representation — the Vertex Enumeration problem — and various other basic and closely related computational problems about polytopes. The problem of converting the vertex representation to halfspace representation — the Convex Hull problem — is equivalent to vertex enumeration. In chapt...
متن کاملOn the Complexity of Some Enumeration Problems for Matroids
Let M be a matroid defined by an independence oracle on ground set S, and let A ⊆ S. We present an incremental polynomial-time algorithm for enumerating all minimal (maximal) subsets of S which span (do not span) A. Special cases of these problems include the generation of bases, circuits, hyperplanes, flats of given rank, circuits through a given element, generalized Steiner trees and multiway...
متن کاملOn enumeration problems in Lie-Butcher theory
The algebraic structure underlying non-commutative Lie-Butcher series is the free Lie algebra over ordered trees. In this paper we present a characterization of this algebra in terms of balanced Lyndon words over a binary alphabet. This yields a systematic manner of enumerating terms in non-commutative Lie-Butcher series.
متن کاملA generalized implicit enumeration algorithm for a class of integer nonlinear programming problems
Presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. Also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. The method is easy to u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2019
ISSN: 0166-218X
DOI: 10.1016/j.dam.2019.02.025