Difference between NP^SAT intersection CoNP^SAT and (NP intersection CoNP)^SAT ?

Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)

Hi,

Is there any difference between the classes $NP^{SAT} \cap CoNP^{SAT}$ (i.e. $\Sigma_2^p \cap \Pi_2^p$) and $(NP \cap CoNP)^{SAT}$? If so, what is the structural difference between the two?

Searching around, I found this paper which shows a relativized world where $NP_{poly} \cap CoNP_{poly}$ is not contained in $(NP \cap CoNP)_{poly}$. Is there any similar result for the question I've asked?

-

4
$\let\M\mathrm$How do you define $(\M{NP}\cap\M{coNP})^{SAT}$, other than $\M{NP}^{SAT}\cap\M{coNP}^{SAT}$? Note that there is no general way of assigning $C^A$ to any given complexity class $C$. There is no concept of “$\M{NP}\cap\M{coNP}$ Turing machines” that you could just relativize. (This is in contrast to nonuniformity, which you mention in the second paragraph: $C/\M{poly}$ is well defined for any class $C$. The result you quote is actually that there is an oracle $A$ such that $\M{NP}^A/\M{poly}\cap\M{coNP}^A/\M{poly}\nsubseteq(\M{NP}^A\cap\M{coNP}^A)/\M{poly}$.) – Emil Jeřábek Sep 5 at 13:01
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 15, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": false, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9300917983055115, "perplexity_flag": "head"}