With Quasilinear Queries EXP Is Not Polynomial Time Turing Reducible to Sparse Sets

DOI10.1137/S0097539792237188MaRDI QIDQ4857596zbMATH OpenOpenAlexFDO

Authors Bin Fu

Publication date 24 January 1996

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539792237188

zbMATH Keywords

polynomial time Turing reductions

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Sparse selfreducible sets and nonuniform lower bounds
• Two Results on Polynomial Time Truth-Table Reductions to Sparse Sets
• Sparse Selfreducible Sets and Polynomial Size Circuit Lower Bounds
• On sets Turing reducible to p-selective sets
• On Certain Polynomial-Time Truth-Table Reducibilities of Complete Sets to Sparse Sets

Cited in

(6)

• AM\(_{\text{exp}}\nsubseteq (\text{NP} \cap \text{coNP})\)/poly
• NE is not NP Turing reducible to nonexponentially dense NP sets
• Dimension, halfspaces, and the density of hard sets
• Separating NE from some nonuniform nondeterministic complexity classes
• On quasilinear-time complexity theory
• Comparing nontriviality for E and EXP

This page was built for publication: With Quasilinear Queries EXP Is Not Polynomial Time Turing Reducible to Sparse Sets

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