علامة space-complexity - هذه الصفحة 45 - GeneraCodice

'Stones' game complexity

https://www.generacodice.com/ar/articolo/1123626/stones-game-complexity
  complexity-theory  -  game-theory  -  space-complexity  -  complexity-classes
cs.stackexchange cs.stackexchange

Proving language in Space Complexity

https://www.generacodice.com/ar/articolo/1122015/proving-language-in-space-complexity
  space-complexity
cs.stackexchange cs.stackexchange

Proving that Turing Machine M runs in time $O(2^{dn})$

https://www.generacodice.com/ar/articolo/1121987/proving-that-turing-machine-m-runs-in-time-o-2-dn
  turing-machines  -  space-complexity
cs.stackexchange cs.stackexchange

What is a compact way to represent a partition of a set?

https://www.generacodice.com/ar/articolo/1121291/what-is-a-compact-way-to-represent-a-partition-of-a-set
  data-structures  -  combinatorics  -  space-complexity  -  sets  -  partitions
cs.stackexchange cs.stackexchange

Why is one often requiring space constructibility in Savitch's theorem?

https://www.generacodice.com/ar/articolo/1120876/why-is-one-often-requiring-space-constructibility-in-savitch-s-theorem
  complexity-theory  -  space-complexity  -  nondeterminism  -  complexity-classes
cs.stackexchange cs.stackexchange

Why does a polynomial-time language have a polynomial-sized circuit?

https://www.generacodice.com/ar/articolo/1120702/why-does-a-polynomial-time-language-have-a-polynomial-sized-circuit
  complexity-theory  -  time-complexity  -  space-complexity  -  complexity-classes  -  polynomial-time
cs.stackexchange cs.stackexchange

Prove that $0$-$1$ $\mathsf{ Ineq}$ is $\mathsf{NL}$-complete

https://www.generacodice.com/ar/articolo/1118802/prove-that-0-1-mathsf-ineq-is-mathsf-nl-complete
  graph-theory  -  complexity-theory  -  space-complexity  -  reductions
cs.stackexchange cs.stackexchange

Prove that 2-Colourability is in L from Undir-Reachability is in L

https://www.generacodice.com/ar/articolo/1118800/prove-that-2-colourability-is-in-l-from-undir-reachability-is-in-l
  graph-theory  -  complexity-theory  -  space-complexity  -  colorings
cs.stackexchange cs.stackexchange

Does $\mathsf{NSPACE}( f (n)) = \mathsf{coNSPACE}( f (n))$ hold for $ f(n) < \log (n) $?

https://www.generacodice.com/ar/articolo/1118166/does-mathsf-nspace-f-n-mathsf-conspace-f-n-hold-for-f-n-log-n
  complexity-theory  -  space-complexity
cs.stackexchange cs.stackexchange

Power of Double - Logarithmic Space

https://www.generacodice.com/ar/articolo/1111508/power-of-double-logarithmic-space
  complexity-theory  -  space-complexity
cs.stackexchange cs.stackexchange
العثور على نتائج: 487
scroll top