<we><edit> <!-- questions and answers -->
reductions
dynamic-programming
strings
recursion
logic
arithmetic
neural-networks
randomness
heuristics
weighted-graphs
landau-notation
graph-theory
complexity-theory
matrices
pushdown-automata
approximation
cpu-cache
type-theory
functional-programming
shortest-path
binary-trees
network-flow
linear-programming
nondeterminism
linear-algebra
complexity-theory
Time complexity bounds for the approximation of optimal values for bounded linear programs
complexity-theory
time-complexity
linear-programming
Subset Sum for {1,...,n}
complexity-theory
time-complexity
subset-sum
Which NP complete problem is this?
complexity-theory
np-complete
np-hard
Relation among $GapP, \#P, PP$ and $CH$
complexity-theory
complexity-classes
Circuit Lower bound for $EXP^{NP}$
complexity-theory
lower-bounds
circuits
Is a minimal deviation version of set partition problem NP-Hard?
complexity-theory
np-complete
np-hard
partitions
Linear time reduction equivalence
complexity-theory
time-complexity
runtime-analysis
polynomial-time
Reduction — Do they work for unrelated problems?
complexity-theory
reductions
Is this summation from an insertion sort complexity analysis correct?
algorithms
complexity-theory
sorting
Containment of ACC$^0$ in TC$^0$
complexity-theory
circuits
References for the computational complexity of training neural networks
complexity-theory
reference-request
neural-networks
A clarification on $NP=coNP$?
complexity-theory
complexity-classes
Computational Complexity and P vs. NP, A New Insight
complexity-theory
turing-machines
np-complete
proof-techniques
p-vs-np
What is the consequence of $\oplus P\neq PP$?
complexity-theory
complexity-classes
is P_CTC = BPP_PATH?
complexity-theory
complexity-classes
quantum-computing
Array with queries to decrement or find sum of range
algorithms
complexity-theory
time-complexity
arrays
Simulating Turing Machine with writing only on non-input fields on read-only Turing machine
complexity-theory
computability
turing-machines
Is there an algorithim to construct a graph with an even number of vertices, and each vertex has k edges?
algorithms
complexity-theory
graphs
graph-theory
How do I develop a structured work method for theoretical computer science?
complexity-theory
formal-languages
computability
How to prove QUADPROG is NP-hard using 3COLOR?
complexity-theory
proof-techniques
np-hard
quadratic-programming
Why Can't Reverse Hashing Prove $P \neq NP$?
complexity-theory
Can I assume every clause of 3SAT has one positive literal?
complexity-theory
satisfiability
3-sat
NP Complete Proof - Polynomial Reduction
complexity-theory
np-complete
reductions
np-hard
Limited oracle TM
complexity-theory
turing-machines
reductions
space-complexity
oracle-machines
Why not a $coNP$ hierarchy?
complexity-theory
complexity-classes
Proving or disproving a set of total functions is countable
complexity-theory
computability
proof-techniques
counting
On the exponential hierarchy?
complexity-theory
complexity-classes
Recursive definition of a language $ L $ over $ \{a,b\} $
complexity-theory
formal-languages
regular-languages
recursion
Computational Irreducibility
complexity-theory
turing-machines
Show that maximum disjoint set problem is NP Complete
complexity-theory
np-complete
3-sat
Integer Programming Complexity
complexity-theory
computability
On $NP=\Sigma_2^P$ from non-deterministic time?
complexity-theory
nondeterminism
P-Completeness and Parallel Computation
complexity-theory
parallel-computing
How does the computational complexity of problems depend on the model specifics of a register machine?
complexity-theory
time-complexity
Is packing a bag of presents easier for Rupert than Santa?
algorithms
complexity-theory
optimization
packing
Reduction of Hamiltonian cycle to Hamiltonian cycle & clique
complexity-theory
Non-deterministic logarithmic time complexity class
complexity-theory
time-complexity
complexity-classes
nondeterminism
$P/poly$ as oracle to itself?
complexity-theory
complexity-classes
oracles
Do we know if there is an oracle $B$ so that $P^B \neq NP^B$ but $coNP^B=NP^B$?
complexity-theory
Is there an polynomial time algorithm to find that sum of square-roots is less than an integer?
algorithms
complexity-theory
time-complexity
On the Impagliazzo-Wigderson condition for derandomization
complexity-theory
complexity-classes
randomized-algorithms
circuits
pseudo-random-generators
Natural logspace complete problems
complexity-theory
space-complexity
NP-hardness of maximum set cover with element-level submodular function
complexity-theory
np-complete
set-cover
Max-min of a nonconvex quadratic problem
complexity-theory
quadratic-programming
NP hardness of partitioning a graph into two subgraphs
complexity-theory
np-hard
max-cut
Meaning of the Time Hierarchy Theorem
complexity-theory
time-complexity
NEXP = Σ$_2$ ⟹ NEXP = MA?
complexity-theory
time-complexity
Given a $NP$ complete decision problem, reduce the search problem of finding verifier to decision problem?
complexity-theory
Solve Time Complexity problem using Time Hierarchy
complexity-theory
time-complexity
polynomial-time
p-vs-np
Problems for which there is no algorithm with smallest time complexity
algorithms
complexity-theory
time-complexity
Does NP ⊆ Co-NP imply NP = Co-NP?
complexity-theory
How would one reduce HaltTM to ATM
complexity-theory
Consequences from a lower bound of SAT problem
complexity-theory
time-complexity
satisfiability
p-vs-np
Proving that a Turing machine decides a language in NP
complexity-theory
logic
Is there a set of NP-hard problems that are most commonly used for proving NP-hardness?
complexity-theory
np-complete
np-hard
np
Is there a concept of information that distinguishes between "computed" and "non-computed" information?
complexity-theory
terminology
Soft Question: Looking for resources on computation over reals
complexity-theory
data-structures
mathematical-foundations
How to prove: If $\textsf{EXP} \subseteq \textsf{P/poly} $ then $\textsf{EXP} = \Sigma^p_2$
complexity-theory
nondeterminism
Does co-TIME(f(n)) = TIME(f(n)) and co-SPACE(f(n)) = SPACE(f(n))?
complexity-theory
Graph coloring decision problem NP-complete
complexity-theory
graphs
np-complete
colorings
P class definition in Garey and Johnson's Computers and Intractability
complexity-theory
time-complexity
How to prove that $nlog(n)$ is space constructible?
complexity-theory
space-complexity
Trying to find Worst Case complexity
complexity-theory
asymptotics
Decide whether there is an integral legal s − t flow in G
complexity-theory
np-complete
matching
If everyone believes P ≠ NP, why is everyone sceptical of proof attempts for P ≠ NP?
complexity-theory
p-vs-np
Show that Knapsack-like problem on directed graph is NP-hard
complexity-theory
graphs
np-hard
Longest palindrome size with suffix trees
algorithms
complexity-theory
suffix-trees
Relations between DSPACE and NSPACE
complexity-theory
complexity-classes
space-complexity
sets
Clarification on a theorem?
complexity-theory
complexity-classes
Partition a set of multisets into increasing sequences of inclusion
algorithms
complexity-theory
Why always NP-complete to prove NP-hard?
complexity-theory
np-complete
np-hard
np
Assuming $\mbox{BPP}\subseteq \Pi_2$ -What conclusions can we make?
complexity-theory
time-complexity
On $BPP\not=SUBEXP$ and $SUBEXP\not\subseteq P/poly$?
complexity-theory
complexity-classes
randomness
lower-bounds
circuits
Reducing Clique to Independent Set
algorithms
complexity-theory
graph-theory
np-complete
When represented as a function, why is the input of a decision problem a natural number?
complexity-theory
Hardness of checking maximal magnitude of a sum of a subset of vectors
algorithms
complexity-theory
np-hard
np
Why the $\textbf{PCP}(\log n, 1)$ construction of completeness $c$ and soundness $s$ for an $NP$ language $L$ implies $s/c$ inapproximability for $L$?
complexity-theory
Interactive protocols for showing knots are "hard" to untie
complexity-theory
graph-isomorphism
interactive-proof-systems
Reduction of graph chromatic number to hypergraph 2-colorability
complexity-theory
graphs
np-complete
How does SETH implies ETH?
complexity-theory
time-complexity
Find Length of longest substring with all 1's in a binary string with k queries
algorithms
complexity-theory
data-structures
time-complexity
c++
Algorithm for finding factor pairs
algorithms
complexity-theory
optimization
time-complexity
factoring
Find the flaw in the P != NP proof
complexity-theory
How to prove the NP-completeness of 15-Partition Problem
complexity-theory
np-complete
partitions
Why doesn't descriptive complexity theory solve P = NP?
complexity-theory
p-vs-np
descriptive-complexity
Inductive proof that $n^2 + bn + d$ is $O(n^2)$ using definition of big O
algorithms
complexity-theory
time-complexity
proof-techniques
induction
How to prove that matrix multiplication of two 2x2 matrices can't be done in less than 7 multiplications?
algorithms
complexity-theory
lower-bounds
Reducing Exact Cover to Subset Sum
complexity-theory
np-complete
reductions
np-hard
What is Geometric complexity theory (GCT)?
complexity-theory
Complexity of 1-in-3 SAT variant with restrictions on "unique" variables per clause
complexity-theory
np-complete
logic
satisfiability
Show a problem using one approach is at least as hard as using another approach
complexity-theory
computability
np-complete
reductions
proof-techniques
Complexity of feasibility of a certain weighted digraph problem
complexity-theory
graph-theory
time-complexity
np-complete
polynomial-time
IN-SPACE ACCEPTANCE Problem is PSPACE-complete
complexity-theory
np-complete
space-complexity
Is $Ω(n\log n)$ the lower-bound for *all* sorting algorithms or *just comparison-based* sorting algorithms?
algorithms
complexity-theory
sorting
lower-bounds
Why the restriction on the length of the proof in a $(r,q)$-verifier in PCP is inconsequential?
complexity-theory
Why polynomial time is called "efficient"?
algorithms
complexity-theory
terminology
efficiency
Communication complexity of string matching
complexity-theory
communication-complexity
On non-determinism with $\oplus P$ oracle
complexity-theory
nondeterminism
Show that problem of Shortest-Path in digraph is in NL
complexity-theory
Limited sort: is this a well-known problem?
complexity-theory
sorting