<we><edit> <!-- questions and answers -->
ho.history-overview
semantics
soft-question
research-practice
randomized-algorithms
hash-function
sat
graph-colouring
nondeterminism
upper-bounds
turing-machines
lo.logic
oracles
gt.game-theory
kolmogorov-complexity
parameterized-complexity
lower-bounds
quantum-computing
gr.group-theory
graph-algorithms
coding-theory
approximation-algorithms
it.information-theory
reductions
approximation-hardness
ds.algorithms
Is there any time efficient way of achieving the result of FKS hashing lemma?
cc.complexity-theory
ds.algorithms
nt.number-theory
Minimizing SubModular Function: Cardinality
ds.algorithms
approximation-algorithms
submodularity
Efficient algorithm for generating data dependency DAG from lists of memory ranges and access modes
ds.algorithms
directed-acyclic-graph
memory
What is the fastest gradient based algorithm to get to criticality of a "nice" non-convex function?
ds.algorithms
reference-request
approximation-algorithms
Knapsack with dependent profits (pairs of items)
ds.algorithms
optimization
Optimal scheduling of Air Conditioning Units
ds.algorithms
What is the fastest known algorithm for finding conjugacy classes?
ds.algorithms
Minimum cost topological ordering
ds.algorithms
directed-acyclic-graph
Find a pair of nodes with maximum sum of distances in k given trees
ds.algorithms
graph-algorithms
complexity-classes
tree
parameterized-complexity
On complexity of ILP
cc.complexity-theory
ds.algorithms
integer-programming
fixed-parameter-tractable
polytope
Diff Algorithms
ds.algorithms
reference-request
Check the match of the maximum of each subset
ds.algorithms
np-hardness
Graph-related applications of the fast Fourier transform (and other algebraic algorithms)
ds.algorithms
graph-algorithms
Algorithm to compute distance between powers
ds.algorithms
randomized-algorithms
nt.number-theory
comp-number-theory
Beating naive dynamic programming: examples similar to integer partitions?
cc.complexity-theory
ds.algorithms
dynamic-programming
Is abelian group isomorphism in $\mathsf{AC^0}$?
cc.complexity-theory
ds.algorithms
Minimal Cost of Eulerian Path
ds.algorithms
graph-theory
graph-algorithms
optimization
Checking formulas with two quantifiers ($\forall \exists$) - 2QBF
ds.algorithms
lo.logic
sat
boolean-functions
How to compute GCD efficiently?
cc.complexity-theory
ds.algorithms
Is sorting $n$ real numbers in time $O(n \sqrt{\log n})$ and linear space possible?
cc.complexity-theory
ds.algorithms
sorting
Polynomial-time algorithms with huge exponent/constant
ds.algorithms
big-list
Is Normal centralizer problem in P?
cc.complexity-theory
ds.algorithms
What is the maximum number of stable marriages for an instance of the Stable Marriage Problem?
ds.algorithms
co.combinatorics
graph-algorithms
heuristics
matching
Complexity of Finding the Eigendecomposition of a Matrix
ds.algorithms
time-complexity
matrices
linear-algebra
na.numerical-analysis
Extended version of the paper "Consistent Hashing and Random Trees" with proofs
ds.algorithms
reference-request
randomized-algorithms
hash-function
cache-oblivious
What is the difference between PRAM and multi threading?
ds.algorithms
OR-circuit complexity of a dense linear operator
ds.algorithms
circuit-complexity
upper-bounds
Cases of Linear programming known to be in $NC$?
cc.complexity-theory
ds.algorithms
complexity-classes
linear-programming
dc.parallel-comp
Is there some research about infinitely many-armed bandit with non-stationary assumption?
ds.algorithms
reference-request
machine-learning
Complexity of the simplex algorithm
ds.algorithms
linear-programming
simplex
smoothed-analysis
Finding the largest set of points of limited diameter (2)
ds.algorithms
reference-request
cg.comp-geom
Can neural networks be used to devise algorithms?
cc.complexity-theory
ds.algorithms
machine-learning
ne.neural-evol
Continous work distribution algorithm with failover
ds.algorithms
co.combinatorics
dc.distributed-comp
Difference between weak duality and strong duality?
ds.algorithms
optimization
linear-programming
primal-dual
Frequency-Count List Accessing Algo - Why free transpositions?
ds.algorithms
Convention for RAM machine models
cc.complexity-theory
ds.algorithms
machine-models
Number of maximally different DAG's in a digraph?
ds.algorithms
graph-algorithms
Computing size of permutation group from generators
ds.algorithms
permutations
Does the following problem have a classical name (e.g. max flow, stable matching, etc) and if so is there an efficient solution?
ds.algorithms
reference-request
approximation-algorithms
Does there exist an ontology for algorithms?
cc.complexity-theory
ds.algorithms
kolmogorov-complexity
Time complexity for solving linear congruences?
ds.algorithms
time-complexity
nt.number-theory
Suffix automata on a queue
ds.algorithms
automata-theory
string-matching
Data structures for subset and superset queries over a set of multisets
ds.algorithms
ds.data-structures
What are some techniques for "balancing" a tree beside heavy-light and centroid decomposition?
ds.algorithms
graph-algorithms
tree
dynamic-algorithms
Amortized analysis of red-black trees
ds.algorithms
binary-trees
Complexity of the mandelbrot set on rationals
cc.complexity-theory
ds.algorithms
time-complexity
space-complexity
fractals
Minimum path edge-cover or minimum flow with unit capacities and DAGs
ds.algorithms
graph-theory
max-flow
\alpha-path on Euclidean graphs
ds.algorithms
graph-algorithms
approximation-algorithms
ds.data-structures
lower-bounds
Have fixed parameter integer program algorithms ever been implemented for research use?
ds.algorithms
reference-request
soft-question
integer-programming
software
What is wrong with this procedure to convert quadratic programming to convex quadratic programming?
ds.algorithms
linear-programming
p-vs-np
convex-optimization
semidefinite-programming
given a set of $n$ points in $d$-dimensional space and the basis vectors of some subspace, how to find all the points on that space?
ds.algorithms
linear-algebra
computational-geometry
data-sets
Finding a sub rectangle with maximum sum
cc.complexity-theory
ds.algorithms
Preference based group generator
ds.algorithms
graph-theory
How to continue this algorithm?
ds.algorithms
optimization
tree
computational-geometry
packing
Ant colony optimization for traveling salesman problem with changing graph-nodes/vertices
ds.algorithms
graph-theory
tsp
heuristics
Equal degree factoring of homogeneous polynomials over $\Bbb Q[x_1,\dots,x_n]$?
ds.algorithms
nt.number-theory
polynomials
algebraic-complexity
factoring
Understanding performance of QFBV SMT solvers
ds.algorithms
sat
heuristics
Algorithms to generate consecutive primes
ds.algorithms
nt.number-theory
primes
Is there a fast algorithm to quickly evaluate $a^{b^c}$ mod $n$?
ds.algorithms
cr.crypto-security
nt.number-theory
comp-number-theory
Using Pearson Correlation Coefficient in computing user/item similarity
ds.algorithms
machine-learning
lg.learning
Permutation phrases with LR parsing
ds.algorithms
fl.formal-languages
parsing
context-free
Optimizing Maximum Weighted Matching (Edmonds Blossom)
ds.algorithms
graph-theory
graph-algorithms
optimization
matching
Practical/heuristic algorithm for multi set-cover
ds.algorithms
reference-request
approximation-algorithms
heuristics
How to find largest supergroup in polynomial time?
ds.algorithms
reference-request
gr.group-theory
Different algorithms for longest increasing subsequence
ds.algorithms
reference-request
What exactly did Lenstra prove on mixed integer linear program?
cc.complexity-theory
ds.algorithms
reference-request
linear-programming
integer-programming
What is known about computing distinct count range queries?
ds.algorithms
ds.data-structures
space-time-tradeoff
Factoring with LLL when the form of the factors is given
ds.algorithms
polynomials
algebraic-complexity
factoring
lattice
Finding k shortest Paths with Eppstein's Algorithm
ds.algorithms
graph-theory
graph-algorithms
directed-acyclic-graph
Complexity of Finding Optimal Synergistic Set Packings
cc.complexity-theory
ds.algorithms
set-cover
scheduling
packing
Difference between PRAM and machine model in dynamic multithreading
ds.algorithms
On permanent mod $3^t$ computation
ds.algorithms
counting-complexity
matrices
permanent
finite-fields
Is it possible to approximate Maximum Independent Set in $O(2^k\text{poly}(n))$ time?
ds.algorithms
approximation-algorithms
fixed-parameter-tractable
exp-time-algorithms
Complexity of very sparse determinant
cc.complexity-theory
ds.algorithms
linear-algebra
sparse-matrix
determinant
Big gaps between RAM and Turing machine complexity
cc.complexity-theory
ds.algorithms
Modifying Edmonds' Blossom Algorithm
ds.algorithms
graph-theory
graph-algorithms
optimization
Is it possible to prove that, for a given problem, no optimal greedy algorithms exist?
ds.algorithms
greedy-algorithms
Graph factors of maximum weight
ds.algorithms
graph-theory
graph-algorithms
matching
What is known about counting bipartite perfect matching with average degree in $[2,3]$ and max degree $3$?
ds.algorithms
graph-theory
counting-complexity
permanent
bipartite-graphs
Max-weight connected & co-connected subgraph problem
ds.algorithms
graph-algorithms
np-hardness
Data Structure to calculate which interval a point lies in?
ds.algorithms
ds.data-structures
interval-graphs
Theoretical explanations for practical success of SAT solvers?
cc.complexity-theory
ds.algorithms
sat
heuristics
What is known about learning a maximal independent set in a (very) sparse graph?
ds.algorithms
graph-algorithms
lg.learning
query-complexity
Efficiently computing the union of all minimal unsatisfiable constraint sets in a first-order unification problem
ds.algorithms
graph-algorithms
lo.logic
Is there a randomized algorithm for set-cover?
ds.algorithms
randomized-algorithms
set-cover
How to construct an $(n,m,k)$ ``separating set''?
ds.algorithms
co.combinatorics
extremal-combinatorics
How to calculate this string-dissimilarity function efficiently?
ds.algorithms
metrics
string-matching
Complexity of Homogenizing a String
cc.complexity-theory
ds.algorithms
reference-request
string-matching
edit-distance
Complexity of $\{0,\pm1\}$ determinant in sparse cases?
cc.complexity-theory
ds.algorithms
matrices
sparse-matrix
determinant
Finding an answer key given tests and scores
ds.algorithms
optimization
Is it possible to unambiguously read back λ terms from interaction nets without node types?
ds.algorithms
lambda-calculus
functional-programming
interaction-nets
Algorithm for finding heavy hitters in a weighted stream
ds.algorithms
reference-request
online-algorithms
data-streams
streaming-algorithms
Why is HyperLogLog (near-)optimal?
ds.algorithms
approximation-algorithms
data-streams
probabilistic-computation
Is berklemap-massey works on extention field
ds.algorithms
finite-fields
Counting multiplicative closures
ds.algorithms
reference-request
co.combinatorics
dynamic-programming
Differences with Penalty
ds.algorithms
Iterative algorithms and Lyapunov functions
ds.algorithms
application-of-theory
iterated-rounding
Complexity status of restricted k-clique
ds.algorithms
graph-algorithms
time-complexity
space-complexity
logspace
Restricted k-set cover is in NL or L
cc.complexity-theory
ds.algorithms
graph-algorithms
logspace
Off-policy Monte Carlo Control
ds.algorithms
machine-learning
markov-chains
monte-carlo