Publication:3826109
From MaRDI portal
zbMath0672.68021MaRDI QIDQ3826109
Publication date: 1988
68Q25: Analysis of algorithms and problem complexity
03D15: Complexity of computation (including implicit computational complexity)
Related Items
Reductions to sets of low information content, On polynomial-time Turing and many-one completeness in PSPACE, On sparse hard sets for counting classes