On the complexity of enumerating ordered sets

DOI10.1007/978-3-031-88946-2_5MaRDI QIDQ6877283zbMATH OpenFDO

Authors Oded Goldreich

Publication date 8 January 2026

Full work available at URL https://doi.org/10.1007/978-3-031-88946-2_5

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx)

Cites work

• A Geometric Approach to Betweenness
• A complexity theory for hard enumeration problems
• Average Case Complete Problems
• Computational Complexity
• On generating all maximal independent sets
• PRIMES is in P
• Recounting the Rationals
• The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.

This page was built for publication: On the complexity of enumerating ordered sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6877283)