scientific article; zbMATH DE number 1107624
From MaRDI portal
Publication:4373559
zbMATH Open0895.68052MaRDI QIDQ4373559
Publication date: 20 September 1998
Title of this publication is not available (Why is that?)
Related Items (3)
Title not available (Why is that?) โฎ Title not available (Why is that?) โฎ There are no sparse NP\(_{w}\)-hard sets
Recommendations
- Title not available (Why is that?) ๐ ๐
- Title not available (Why is that?) ๐ ๐
- Title not available (Why is that?) ๐ ๐
- Sparse sets, approximable sets, and parallel queries to NP ๐ ๐
- \(P^{NP[O(\log n)}\) and sparse turing-complete sets for NP] ๐ ๐
- A note on sparse sets and the polynomial-time hierarchy ๐ ๐
- On reductions of NP sets to sparse sets ๐ ๐
- Sparse Sets in : Relativizations ๐ ๐
- Sparse sets in NP-P: EXPTIME versus NEXPTIME ๐ ๐
- Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets ๐ ๐
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4373559)