## NCNC and FNCFNC oracles low for functional and Stockemeyer classes respectively?

We know PNC=P and FPFNC=FP hold. Do FPNC=FP and PFNC=P hold? Answer AttributionSource : Link , Question Author : Turbo , Answer Author : Community

We know PNC=P and FPFNC=FP hold. Do FPNC=FP and PFNC=P hold? Answer AttributionSource : Link , Question Author : Turbo , Answer Author : Community

This is a (hopefully) sharper version of a question that I asked previously. Which of these algorithms is believed to have a longer asymptotic runtime? The optimal algorithm guaranteed to solve some NP-complete problem using a standard Turing machine. The optimal algorithm guaranteed to solve the problem described by Raz and Tal using a Turing … Read more

Let say A and B are two decesion problems where A ≤ B polinomial reduction is true. Is this : A̅ ≤ B̅ also true? If so, can you show an exemple, if not why? Answer AttributionSource : Link , Question Author : Jphn Doe , Answer Author : Community

What are some of the most ridiculous possible claims in computer science that we haven’t disproved? E.g. For example the claim that ZPP=exptime is absurd but has not been disproven. Answer AttributionSource : Link , Question Author : blademan9999 , Answer Author : Community

Is NC1 vs PP still an open problem? I done a few searched but I can’t find an answer. Answer AttributionSource : Link , Question Author : blademan9999 , Answer Author : Community

Are there any “natural problems” which are known to be NPI under weak assumptions. By weak assumptions I mean something like P≠NP or NP≠Co−NP Answer AttributionSource : Link , Question Author : blademan9999 , Answer Author : Community

For example, whether there exists PSPACE-hard sparse language an open problem, as it is not yet known whether polynomial hierarchy collapses. But is it a solved problem for larger complexity classes like EXP or PR? What is the smallest complexity class (that is larger than PSPACE) for which it is a solved problem? Answer AttributionSource … Read more

Is there a method to prove things with longer input in complexity theory? For example, using padding argument it’s trivial to show that NTIME(n2)⊆DTIME(n4)⇒∀k≥2,NTIME(nk)⊆DTIME(n2k) Is there a common method for the opposite direction, i.e., for something like NTIME(n4)⊆DTIME(n12)⇒∀1≥k<4,NTIME(nk)⇒DTIME(n3k)? Answer AttributionSource : Link , Question Author : homecute , Answer Author : Community

If a problem is NP-complete with respect to randomized (polynomial time) reductions, but not with respect to deterministic reductions, then we have P ≠ BPP (See Question 2 here and its answer). Suppose a decision problem is proved to be NP-complete; and it is also proved to be DP-complete with respect to randomized reductions. Does … Read more

I have two related questions: What are the ways to prove that a certain problem is in W[t] in the W-hierarchy for parametrized complexity, except using the straight definition of boolean circuits? I mean, is there a similar classification like for the FPT class, that if there exists an algorithm which runs in a certain … Read more