### complexity-theory

What is O(1) space complexity?

Solving 2sat #P algorithm results into P=NP

Parallel efficiency for topological ordering of directed acyclic graph

Complexity of T(n)=T(cn)+T((1−c)n)

Karp reduction from PARTITION to SUBSET SUM

Is polynomial reduction reversible?

How do I reduce Hamiltonian path to a weight-constrained Hamiltonian path?

Provide a context-free grammar that generates odd length language {w = 0*1* : |w| is odd} [closed]

Decision tree complexity - And-or function

How do I prove a class-room scheduling issue to be NP complete correctly?

how to justify that “Tile Cover” is in NP

Is reduction possible from P to NP?

Reference for double dominating set is NP-hard

Trying to trace out the solution, what function does this program compute?

Recurrence relation asymptotic complexity

complexity of calling a function n times

Why co-NP is not a subset of NP

Prove a language in not in coNP

finding complexity using induction

Computational Complexity of Winnowing

Why is chess, checkers, Go, etc. in EXP but conjectured to be in NP?

How reduction is used to prove hardness through contradiction?

What is an approach for designing complex FSMs?

How do I get to the final expression in T(n)

Algebra and Complexity Classes

Chomsky Normal Form Conversion Algorithm

What does this sentence mean “It is NP-hard to approximate the Max-3-DM with bound 2 ”?

Cost of a round-based distributed algorithm

How can I find a witness to the relation n! is O(n^n)? [closed]

Which operator is more powerful plus(+) or increment(++)

Order of complexity of fibonacci functions

Is the complement of the language CLIQUE element of NP?

Knapsack restore solution complexity

complexity calculation of summation

Is the complement of any context free language context free?

Complexity of multiplication reducing modulo N after each step

Why is NP only the set of decision problems?

Why do we get to pick the source in an NP-completeness reduction?

Proving that a language's length is divided by 2 is undecidable

Why is the term 'reduce' used in the context of NP complexity?

Complexity of subset sum with multiple targets

An algorithm to prove that for a constant K, K-Clique in P?

Trying to proof NP-completeness

In a reduction with additive but nonlinear blow up can I still get APX-Hardness?

Computational Complexity of SIFT descriptor?

Calculating complexities of both time and space

A little help finding the complexity of time and and complexity of space

Is the Reduction function a correspondence?

3SAT solved in polynomial time?

### Related Links

Why is the term 'reduce' used in the context of NP complexity?

Complexity of subset sum with multiple targets

An algorithm to prove that for a constant K, K-Clique in P?

Trying to proof NP-completeness

In a reduction with additive but nonlinear blow up can I still get APX-Hardness?

Computational Complexity of SIFT descriptor?

Time Complexity Dijkstra

TSP vs. Word Unscrambler

If a deterministic Turing Machine decides a language L, does it mean that it also decides L's complement?

Calculating complexities of both time and space

A little help finding the complexity of time and and complexity of space

Is the Reduction function a correspondence?

3SAT solved in polynomial time?

Finding roots in multiply rooted graphs

Kolmogorov complexity is uncomputable using reductions

Max Flow and NP, Need some Experts Verify this challenge?