Enumeration of the Monomials of a Polynomial and Related Complexity Classes
From MaRDI portal
Publication:3586118
DOI10.1007/978-3-642-15155-2_55zbMath1287.68082arXiv1004.3020OpenAlexW3122543889MaRDI QIDQ3586118
Publication date: 3 September 2010
Published in: Mathematical Foundations of Computer Science 2010 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1004.3020
Analysis of algorithms and problem complexity (68Q25) Exact enumeration problems, generating functions (05A15) Approximation algorithms (68W25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (14)
Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs ⋮ Tree automata and pigeonhole classes of matroids. I ⋮ Enumerating teams in first-order team logics ⋮ On enumerating monomials and other combinatorial structures by polynomial interpolation ⋮ Tree automata and pigeonhole classes of matroids. II ⋮ Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight ⋮ Enumerating models of DNF faster: breaking the dependency on the formula size ⋮ The Weight in Enumeration ⋮ Monadic second-order model-checking on decomposable matroids ⋮ Incremental delay enumeration: space and time ⋮ A complexity theory for hard enumeration problems ⋮ Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs ⋮ Enumerating Minimal Dominating Sets in Triangle-Free Graphs ⋮ A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs
This page was built for publication: Enumeration of the Monomials of a Polynomial and Related Complexity Classes
