Tag polynomial-time - Esta é a página 8 - GeneraCodice

Polynomial Time Algorithm for Steiner Tree Problem

https://www.generacodice.com/pt/articolo/1606008/polynomial-time-algorithm-for-steiner-tree-problem
  algorithms  -  polynomial-time
cs.stackexchange cs.stackexchange

Determine whether a system of $n$ linear equations has solutions in $\{0, 1\}^n$ in polynomial time

https://www.generacodice.com/pt/articolo/1605710/determine-whether-a-system-of-n-linear-equations-has-solutions-in-0-1-n-in-polynomial-time
  complexity-theory  -  np-complete  -  time-complexity  -  polynomial-time
cs.stackexchange cs.stackexchange

Are you allowed to change the specifications of a problem when doing reductions?

https://www.generacodice.com/pt/articolo/1605178/are-you-allowed-to-change-the-specifications-of-a-problem-when-doing-reductions
  graphs  -  reductions  -  polynomial-time
cs.stackexchange cs.stackexchange

Find Hamiltonian cycle in polynomial time

https://www.generacodice.com/pt/articolo/1604751/find-hamiltonian-cycle-in-polynomial-time
  time-complexity  -  polynomial-time  -  hamiltonian-circuit
cs.stackexchange cs.stackexchange

Existence of polynomial time reduction from P to R?

https://www.generacodice.com/pt/articolo/1603343/existence-of-polynomial-time-reduction-from-p-to-r
  complexity-theory  -  computability  -  time-complexity  -  reductions  -  polynomial-time
cs.stackexchange cs.stackexchange

Probability of randomly designated subsets cover the universe

https://www.generacodice.com/pt/articolo/1603289/probability-of-randomly-designated-subsets-cover-the-universe
  discrete-mathematics  -  probability-theory  -  set-cover  -  algorithms  -  polynomial-time
cs.stackexchange cs.stackexchange

Polynomial Complexity (Relative to the Size of the Input)

https://www.generacodice.com/pt/articolo/1602444/polynomial-complexity-relative-to-the-size-of-the-input
  complexity-theory  -  polynomial-time
cs.stackexchange cs.stackexchange

Proving special case of SAT is in P

https://www.generacodice.com/pt/articolo/1602179/proving-special-case-of-sat-is-in-p
  satisfiability  -  algorithms  -  polynomial-time
cs.stackexchange cs.stackexchange

Given $k$ points in $n$-dimensions, such that $n\geq3$, is there a polytime algorithm for finding a curve that splits them into 2 sets of points?

https://www.generacodice.com/pt/articolo/1601667/given-k-points-in-n-dimensions-such-that-n-geq3-is-there-a-polytime-algorithm-for-finding-a-curve-that-splits-them-into-2-sets-of-points
  classification  -  algorithms  -  polynomial-time
cs.stackexchange cs.stackexchange

polynomial time reducibility - $L_{2} \notin \textbf{P}$ and $L_{1} \leq_{p} L_{2} \implies L_{1} \notin \textbf{P}$

https://www.generacodice.com/pt/articolo/1600573/polynomial-time-reducibility-l-2-notin-textbf-p-and-l-1-leq-p-l-2-implies-l-1-notin-textbf-p
  formal-languages  -  reductions  -  polynomial-time
cs.stackexchange cs.stackexchange
Resultados encontrados: 298
scroll top