<we><edit> <!-- questions and answers -->
lo.logic
turing-machines
graph-algorithms
complexity-classes
quantum-computing
application-of-theory
graph-colouring
context-free
nondeterminism
dc.parallel-comp
time-complexity
linear-programming
matching
communication-complexity
proofs
arithmetic-circuits
spectral-graph-theory
lower-bounds
kolmogorov-complexity
circuit-complexity
open-problem
research-practice
ho.history-overview
ds.algorithms
treewidth
Theoretical Computer Science
theoretical computer scientists and researchers in related fields
User
31.741
Votes
205.388
Comments
73.942
Questions
9.134
Answers
13.457
Solved Questions
4.272
Unsolved Questions
2.211
lo.logic
turing-machines
graph-algorithms
complexity-classes
quantum-computing
application-of-theory
graph-colouring
context-free
nondeterminism
dc.parallel-comp
time-complexity
linear-programming
matching
communication-complexity
proofs
arithmetic-circuits
spectral-graph-theory
lower-bounds
kolmogorov-complexity
circuit-complexity
open-problem
research-practice
ho.history-overview
ds.algorithms
treewidth
ds.data-structures
polynomial-time
type-systems
nt.number-theory
lambda-calculus
matrices
algebra
np-complete
counting-complexity
conditional-results
cr.crypto-security
derandomization
coding-theory
ct.category-theory
dc.distributed-comp
np
functional-programming
type-theory
graph-theory
ne.neural-evol
computability
advice-request
machine-learning
randomness
physics
integer-programming
big-list
tree
parameterized-complexity
it.information-theory
quantum-information
oracles
linear-algebra
optimization
big-picture
shortest-path
approximation-hardness
graph-isomorphism
np-hardness
polynomials
gt.game-theory
approximation-algorithms
reductions
p-vs-np
boolean-functions
regular-language
planar-graphs
proof-complexity
sat
set-cover
pr.probability
randomized-algorithms
ai.artificial-intel
grammars
soft-question
cg.comp-geom
convex-optimization
cc.complexity-theory
factoring
reference-request
gr.group-theory
sorting
fl.formal-languages
pl.programming-languages
terminology
directed-acyclic-graph
automata-theory
space-bounded
clique
semantics
lg.learning
permutations
computational-geometry
algebraic-complexity
co.combinatorics
Polynomial hierarchy in communication complexity?
communication-complexity
NP-hardness of finding 0-1 vector to maximize rows of {-1, +1} matrix
cc.complexity-theory
co.combinatorics
optimization
np
In the Hott book, are the most of the type formers redundant? And if so, why?
type-theory
dependent-type
homotopy-type-theory
SAMECONFIG language is PSPACE-complete
pspace
Beating naive dynamic programming: examples similar to integer partitions?
cc.complexity-theory
ds.algorithms
dynamic-programming
How to be more "theory-minded"?
soft-question
advice-request
When it is said an algorithm runs in exponential time, is it meant it has complexity O(2^n), or 2^O(n)?
complexity-classes
Are single hidden-layered neural networks at least as good as multi hidden-layered neural networks?
machine-learning
ne.neural-evol
universal-computation
Enumerating decidable languages
computability
turing-machines
decidability
undecidability
enumeration
Regular language that discriminates between two deterministic CFGs
automata-theory
Proof of Majority is stablest in "reverse" in the MAXCUT hardness paper by Khot et al
cc.complexity-theory
boolean-functions
pcp
unique-games-conjecture
Proving properties about a compilation from one problem into another
reductions
Why are one way functions and pseudorandom number generators considered necessary or essential for derandomization?
cc.complexity-theory
big-picture
derandomization
pseudorandom-generators
one-way-function
Use of physical environment to obtain useful results
implementation
Möbius values of CNF and DNF lattices of a monotone Boolean function
boolean-functions
combinatorics
lattice
Is there any version of a Turing machine that can generate points of a specified probability distribution?
turing-machines
probabilistic-computation
Binary vector $t$ in $span(S)$ over $\mathbb{Z}/q\mathbb{Z}$ for all prime powers $q$ $\Rightarrow$ $t$ in $span(S)$ over $\mathbb{Z}$?
reference-request
linear-algebra
finite-fields
Set of total functions is countable for non-equivalent turing machines
automata-theory
turing-machines
proofs
proof-complexity
How fine-grained can the time hierarchy theorem be in a reasonable model?
cc.complexity-theory
time-hierarchy
Is there any book on the philosophical implications of Theoretical Computer Science?
reference-request
soft-question
philosophy
Lower bound on the complexity of projection onto simplex?
optimization
Are there wholistic models of the universe in terms of Quantum Complexity?
quantum-information
universal-computation
exact cover problem with Simulated annealing or genitics algorithms
set-cover
heuristics
genetic-algorithms
exact-cover
Functions that are Not Efficiently Computable but Learnable
cc.complexity-theory
np-hardness
machine-learning
turing-machines
lg.learning
Can neural networks be used to devise algorithms?
cc.complexity-theory
ds.algorithms
machine-learning
ne.neural-evol
Is $CAPP \in P$ known to collapse some quantum complexity classes to classical ones?
quantum-computing
circuit-complexity
What would be implied regarding P and NP if a P-complete was shown to be not NP-complete?
np-complete
p-vs-np
Non-Uniform Classes of Languages not Closed Under Complement
circuit-complexity
What do stronger circuit lower bounds give in terms of derandomization?
circuit-complexity
lower-bounds
derandomization
nondeterminism
advice-and-nonuniformity
Is Biological Computation a theme covered by the Theoretical Computer Science?
soft-question
big-picture
natural-computing
church-turing-thesis
size of the induced matching
graph-theory
matching
Space efficient "industrial" unbalanced expanders
graph-theory
derandomization
expanders
Yao's Minimax Principle on Monte Carlo Algorithms
randomized-algorithms
Buckets in Hopcroft-Ullman analysis of Union-Find
cc.complexity-theory
ds.algorithms
ds.data-structures
amortized-analysis
Confusion about "moves" in the valency argument for consensus numbers
dc.distributed-comp
concurrency
Complexity of a variant of partition problem
cc.complexity-theory
np
partition-problem
Continous work distribution algorithm with failover
ds.algorithms
co.combinatorics
dc.distributed-comp
Does crossover take the parents or the offsprings? How to select parents with linear ranking?
genetic-algorithms
genetic-programming
Difference between weak duality and strong duality?
ds.algorithms
optimization
linear-programming
primal-dual
Does Kannan's theorem imply that NEXPTIME^NP ⊄ P/poly?
cc.complexity-theory
complexity-classes
time-complexity
oracles
circuits
Quantum computing
quantum-computing
Maximum weight non-overlapping paths in a DAG
graph-theory
max-flow-min-cut
Minimum cut on a directed graph with negative term
graph-theory
max-flow-min-cut
Is there a P-complete problem on diophantine equations?
cc.complexity-theory
linear-algebra
polynomials
The Maxwell's Demon and Computer Science
soft-question
big-picture
it.information-theory
physics
Knapsack with dependent profits (pairs of items)
ds.algorithms
optimization
Reference Request: complexity results on finding $(1+\epsilon) \log n$ size clique in $G(n,1/2)$
cc.complexity-theory
reference-request
time-complexity
clique
random-graphs
Chaos and the $P{=}NP$ question
cc.complexity-theory
p-vs-np
Approximating max coverage problem with slightly more than K sets
set-cover
approximation
Distributing a binary relation into bins such that each element is in a small number of bins
combinatorics
Understanding the No Free Lunch Theorem
optimization
machine-learning
Suggested approach to cover data structure literature
soft-question
ds.data-structures
Frequency-Count List Accessing Algo - Why free transpositions?
ds.algorithms
Program equivalence wherein the programs are known to always halt
halting-problem
equivalence
How to solve the Shortest Hamiltonian Path problem on Sparse Graphs?
graph-algorithms
co.combinatorics
shortest-path
Could computers calculate time before it happens in the future?
computability
linear-programming
Automated proving that a program doesn't halt
lo.logic
automated-theorem-proving
halting-problem
Minimal Cost of Eulerian Path
ds.algorithms
graph-theory
graph-algorithms
optimization
What is "Effects" in Program Graph?
model-checking
Randomized Algorithm Analysis
cc.complexity-theory
ds.algorithms
randomized-algorithms
recursive
Matrix Coloring under Vertical and Horizontal Constraints
reference-request
np-hardness
np-complete
board-games
Convention for RAM machine models
cc.complexity-theory
ds.algorithms
machine-models
Most general setting for fine-grained exponential-time complexity classes?
reference-request
time-complexity
exp-time-algorithms
machine-models
problem extracting correct results using relational algebra
lo.logic
db.databases
relational-structures
Reduction of graph chromatic number to hypergraph 2-colorability
cc.complexity-theory
np-hardness
np
np-complete
hypergraphs
Basic property of boolean functions with restrictions
boolean-functions
fourier-analysis
Fine-grained complexity of BPP
cc.complexity-theory
derandomization
Extended Church-Turing Thesis
soft-question
lo.logic
church-turing-thesis
Where is relational parametricity in hyperdoctrine or topos models explored?
type-theory
parametricity
Graph sparsification and eigenspaces
na.numerical-analysis
sparse-matrix
Is there a notion of computability on sets other than the natural numbers?
computability
The problem of whether or not every function computable in time $T(n)$ is computable in time $T(n)^{O(1)}$ and space $T(n)^{o(1)}$ simultaneously
reference-request
time-complexity
space-complexity
Why do spectral ultrasparsifiers need to be trees
graph-theory
linear-algebra
spectral-graph-theory
linear-equations
Computational Tree Logic (CTL) Proof
proofs
Stronger reductions in parameterized complexity
cc.complexity-theory
reference-request
parameterized-complexity
Counting the number of connected components in a dynamic plane graph
graph-theory
graph-algorithms
planar-graphs
An alternative formulation of max flow problem
graph-theory
linear-programming
max-flow-min-cut
max-flow
multicommodity-flow
Edges that don't support non zero flow in any maximum flow
max-flow
Stacks serving interval storage requests
approximation-algorithms
optimization
scheduling
interval-graphs
Is this generalization of context free grammars known and strict?
fl.formal-languages
context-free
Learning a discrete distribution in $\ell_r$ norm
machine-learning
lg.learning
st.statistics
Need explanation about asynchronous IO automaton
ds.algorithms
dc.distributed-comp
proofs
Simulate a process of state change with transition probability dependent on proportion in state in previous time
markov-chains
Are there variants of visibly pushdown automata that allow pushing of words onto the stack?
reference-request
fl.formal-languages
automata-theory
context-free
context-free-languages
Finding a common factor in $\lambda$-terms that agree under certain substitutions
type-theory
lambda-calculus
typed-lambda-calculus
Minimizing a sum of thresholded quadratics
optimization
linear-algebra
"Context" understanding in tree grammars
fl.formal-languages
tree
grammars
context-free
Real computers have only a finite number of states, so what is the relevance of Turing machines to real computers?
soft-question
fl.formal-languages
automata-theory
big-picture
turing-machines
references for optimal computation under memory constraint?
computability
space-bounded
Why isn't the Charikar algorithm for finding the densest subgraph optimal?
graph-theory
graph-algorithms
approximation
Is BPP= P known for ANY uniform model of computation?
cc.complexity-theory
circuit-complexity
derandomization
Is there a name for this property of a term rewriting system?
reference-request
fl.formal-languages
term-rewriting-systems
Efficient Online Algorithms for Matrix rank
matrices
online-algorithms
Sufficient conditions for the collapse of Polynomial Hierarchy (PH)
cc.complexity-theory
complexity-classes
big-list
Unbalanced connected partition
graph-theory
graph-algorithms
approximation-algorithms
partition-problem
Direct SAT to 3-SAT reduction
cc.complexity-theory
sat
reductions
On $\Sigma \Pi \Sigma \Pi(2,r)$-circuits
algebra
polynomials
polynomial-time
algebraic-complexity
Janson-type inequality, limited dependence
reference-request
pr.probability
chernoff-bound
A class of languages admitted by a class of grammars equivalent to $\mathbf{PR}$?
complexity-classes
fl.formal-languages
grammars
Examples of quasilinear vs. essentially linear time translatable models
reference-request
time-complexity
machine-models