scientific article; zbMATH DE number 1332663

zbMATH Open0924.68092MaRDI QIDQ4259984FDOQ4259984

Authors: Ogihara, Mitsunori 

Publication date: 8 September 1999

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 1008513
• scientific article; zbMATH DE number 3984573
• Sparse sets, approximable sets, and parallel queries to NP
• scientific article; zbMATH DE number 1304328
• Hardness of sparse sets and minimal circuit size problem
• On the existence of hard sparse sets under weak reductions
• Sparse hard sets for P: Resolution of a conjecture of Hartmanis
• A note on sparse sets and the polynomial-time hierarchy
• Sparse sets in NP-P: EXPTIME versus NEXPTIME
• scientific article; zbMATH DE number 1107624

zbMATH Keywords

logspacesparse complete sets

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cited In (1)

• Complexity of equations over sets of natural numbers

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 Q4259984)