タグreductions - これはページ11です - GeneraCodice

Example of two undecidable languages that cannot be reduced to each other

https://www.generacodice.com/jp/articolo/1811059/example-of-two-undecidable-languages-that-cannot-be-reduced-to-each-other
  turing-machines  -  automata  -  formal-languages  -  reductions
cs.stackexchange cs.stackexchange

How do we construct reductions for NP-Completeness

https://www.generacodice.com/jp/articolo/1810826/how-do-we-construct-reductions-for-np-completeness
  np-complete  -  reductions
cs.stackexchange cs.stackexchange

Is finding the minimum feedback arc set on graph with two outgoing arcs for each node np-complete?

https://www.generacodice.com/jp/articolo/1810460/is-finding-the-minimum-feedback-arc-set-on-graph-with-two-outgoing-arcs-for-each-node-np-complete
  complexity-theory  -  np-complete  -  reductions
cs.stackexchange cs.stackexchange

Reductions from non decision problems

https://www.generacodice.com/jp/articolo/1810070/reductions-from-non-decision-problems
  complexity-theory  -  np-complete  -  computability  -  approximation  -  reductions
cs.stackexchange cs.stackexchange

Partition into pairs with minimum absolute difference, NP-hard?

https://www.generacodice.com/jp/articolo/1809714/partition-into-pairs-with-minimum-absolute-difference-np-hard
  complexity-theory  -  np-hard  -  algorithms  -  reductions
cs.stackexchange cs.stackexchange

Can current quantum computers decide languages that Turing Machines cannot?

https://www.generacodice.com/jp/articolo/1809438/can-current-quantum-computers-decide-languages-that-turing-machines-cannot
  turing-machines  -  quantum-computing  -  undecidability  -  reductions  -  church-turing-thesis
cs.stackexchange cs.stackexchange

Clique-or-almost reduction to clique

https://www.generacodice.com/jp/articolo/1808408/clique-or-almost-reduction-to-clique
  np-hard  -  reductions
cs.stackexchange cs.stackexchange

Why log-space reduction is used for NL-completeness while PSPACE reduction isn't used for PSPACE completeness?

https://www.generacodice.com/jp/articolo/1620803/why-log-space-reduction-is-used-for-nl-completeness-while-pspace-reduction-isn-t-used-for-pspace-completeness
  complexity-theory  -  time-complexity  -  space-complexity  -  reductions  -  complexity-classes
cs.stackexchange cs.stackexchange

Is Finding A Hitting Set of Size n/2 NP-Hard?

https://www.generacodice.com/jp/articolo/1620725/is-finding-a-hitting-set-of-size-n-2-np-hard
  set-cover  -  reductions
cs.stackexchange cs.stackexchange

I want to know where there is the flaw in my argument

https://www.generacodice.com/jp/articolo/1620676/i-want-to-know-where-there-is-the-flaw-in-my-argument
  turing-machines  -  halting-problem  -  undecidability  -  reductions
cs.stackexchange cs.stackexchange
結果が見つかりました: 998
scroll top