Tag p-vs-np - Это страница 5 - GeneraCodice

How is $\text{PCP}[O(\log n),O(1)]$ NOT P?

https://www.generacodice.com/ru/articolo/1621303/how-is-text-pcp-o-log-n-o-1-not-p
  complexity-theory  -  p-vs-np
cs.stackexchange cs.stackexchange

Is the P vs NP problem, an NP or co-NP problem?

https://www.generacodice.com/ru/articolo/1616205/is-the-p-vs-np-problem-an-np-or-co-np-problem
  complexity-theory  -  p-vs-np
cs.stackexchange cs.stackexchange

Contradiction proof for inequality of P and NP?

https://www.generacodice.com/ru/articolo/1612335/contradiction-proof-for-inequality-of-p-and-np
  complexity-theory  -  time-complexity  -  p-vs-np
cs.stackexchange cs.stackexchange

A tricky P=NP problem

https://www.generacodice.com/ru/articolo/1610889/a-tricky-p-np-problem
  complexity-theory  -  np  -  decision-problem  -  p-vs-np
cs.stackexchange cs.stackexchange

If graph isomorphism is in P, is then P = NP?

https://www.generacodice.com/ru/articolo/1607901/if-graph-isomorphism-is-in-p-is-then-p-np
  complexity-theory  -  np-complete  -  p-vs-np  -  graph-isomorphism
cs.stackexchange cs.stackexchange

Effective Procedures and P vs NP Problem

https://www.generacodice.com/ru/articolo/1607289/effective-procedures-and-p-vs-np-problem
  formal-methods  -  p-vs-np  -  mathematical-foundations
cs.stackexchange cs.stackexchange

Why any problem can be reduced to SAT is NP-Complete?

https://www.generacodice.com/ru/articolo/1606392/why-any-problem-can-be-reduced-to-sat-is-np-complete
  complexity-theory  -  np-complete  -  p-vs-np
cs.stackexchange cs.stackexchange

Given that A reduces to B in $O(n^2)$ and B is solvable in $O(n^3)$, solve A

https://www.generacodice.com/ru/articolo/1605253/given-that-a-reduces-to-b-in-o-n-2-and-b-is-solvable-in-o-n-3-solve-a
  reductions  -  p-vs-np
cs.stackexchange cs.stackexchange

Can we detect perfect matchings in P? in NP? in coNP?

https://www.generacodice.com/ru/articolo/1605195/can-we-detect-perfect-matchings-in-p-in-np-in-conp
  p-vs-np
cs.stackexchange cs.stackexchange

Are there problems that are DSPACE(O(1)) complete?

https://www.generacodice.com/ru/articolo/1603363/are-there-problems-that-are-dspace-o-1-complete
  complexity-theory  -  finite-automata  -  p-vs-np
cs.stackexchange cs.stackexchange
Результаты найдены: 190
scroll top