On the power of enumerative counting
From MaRDI portal
Publication:1199550
DOI10.1016/0020-0190(92)90002-DzbMath0754.68050OpenAlexW2069237346MaRDI QIDQ1199550
Sanjeev Saluja, K. V. Subrahmanyam
Publication date: 16 January 1993
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(92)90002-d
Cites Work
- Unnamed Item
- The complexity of computing the permanent
- A note on enumerative counting
- A low and a high hierarchy within NP
- The complexity of combinatorial problems with succinct input representation
- Relative complexity of checking and evaluating
- Enumerative counting is hard
- Relativized counting classes: Relations among thresholds, parity, and mods
- On the power of parity polynomial time
This page was built for publication: On the power of enumerative counting