<we><edit> <!-- questions and answers -->
turing-machines
pumping-lemma
decision-problem
np-hard
search-trees
image-processing
asymptotics
approximation
graph-theory
space-complexity
linear-algebra
nondeterminism
shortest-path
computation-models
heuristics
neural-networks
terminology
sets
functional-programming
arrays
landau-notation
computer-networks
recurrence-relation
probability-theory
automata
algorithms
Existential Theory of the Reals in NP?
algorithms
complexity-theory
np-hard
np
Maximum sum subset of an array with an extra condition
algorithms
optimization
dynamic-programming
subsequences
Task scheduling algorithm (minimize wait time)
algorithms
optimization
scheduling
How do I construct a doubly connected edge list given a set of line segments?
algorithms
data-structures
computational-geometry
How to visualize abstract concepts?
algorithms
Higher Residuocity Problem w.r.t. a composite Modulus
algorithms
number-theory
Algorithm for weighted elliptic curve fit
algorithms
image-processing
mathematical-programming
video
Time Complexity analysis for Map-Reduce model
algorithms
algorithm-analysis
runtime-analysis
parallel-computing
Bellman-Ford and zero-distance cycle
algorithms
graphs
shortest-path
Open source implementation of Multiscale Combinatorial Grouping
algorithms
computer-vision
image-processing
python
Algorithm: Shortest path (walk) with keys and doors
algorithms
graphs
shortest-path
Finding maximum-cardinality independent set with a particular oracle
algorithms
graphs
reductions
How to define the partial or total order of the segments to be inserted in a "sweep-line status" data structure?
algorithms
data-structures
computational-geometry
What if Indexes in Hoare's Quick Sort Algorithm Both Land on Values Less than Pivot?
algorithms
sorting
quicksort
Verifying whether a description of a shortest path tree is actually the shortest path tree in O(V+E) time
algorithms
trees
shortest-path
Given a number, getting a grid position in a spiral pattern
algorithms
Finding $d$ in RSA Encryption mathematically and by hand
algorithms
complexity-theory
algorithm-analysis
cryptography
encryption
Do the edges in the least cost paths given by Bellman-Ford algorithm produce a spanning tree?
algorithms
graph-theory
Predicting next action to take to reach a final state
algorithms
artificial-intelligence
neural-networks
neural-computing
time-series-analysis
Build-Max-Heap: Why Start i at floor(A.length/2) rather than A.length?
algorithms
data-structures
heaps
Calculating unbalanced binary trees
algorithms
binary-trees
Algorithm for sorting people into groups by preference and score
algorithms
Algorithm for shortest continuous line to join N points
algorithms
optimization
euclidean-distance
Finding The Shortest Path In Scotland Yard?
algorithms
graphs
graph-theory
shortest-path
Intuition behind the reduction of 3-DNF PAC Learnability to 3-Graph-Coloring
algorithms
complexity-theory
machine-learning
How to validate a connect X game (Tick-Tak-Toe,Gomoku,...)?
algorithms
artificial-intelligence
search-trees
board-games
computer-games
The purpose of grey node in graph depth-first search
algorithms
graphs
search-algorithms
graph-traversal
Prove complexity bound without reduction?
algorithms
complexity-theory
np-complete
reductions
cryptography
Finding the maximum of a random forest
algorithms
optimization
machine-learning
combinatorics
C# Grammatical Evolution mapping process implementation
algorithms
formal-grammars
evolutionary-computing
Filling a string with wildcards with minimum cost
algorithms
optimization
strings
discrete-mathematics
Number of binary matrices with all 1's connected
algorithms
graphs
The path with the highest sum of weights
algorithms
graphs
dynamic-programming
graph-traversal
ford-fulkerson
Finding a (Small-Big-Medium) subsequence
algorithms
divide-and-conquer
subsequences
Count the unique subsequences
algorithms
strings
subsequences
Can Floyd-Warshall algorithm be used in an undirected graph with negative edges?
algorithms
graphs
Undirected graph find minimal wight sum so every cycle has at least one weighted edge included
algorithms
graphs
Time interval correction for step detection algorithm
algorithms
Algorithms for procedural generated mazes
algorithms
graphs
randomized-algorithms
spanning-trees
computer-games
Local search (Hill Climbing) scope and definition
algorithms
optimization
search-algorithms
Merge Leaf labeled trees
algorithms
graphs
algorithm-analysis
time-complexity
trees
Shift Organization algorithms (Constraint Programming + Marriage problem)
algorithms
optimization
combinatorics
constraint-programming
branch-and-bound
How does matrix chain multiplication problem has an optimal substructure?
algorithms
dynamic-programming
matrices
bakery algorithm, switching up the condition
algorithms
operating-systems
distributed-systems
concurrency
synchronization
What is the fastest online sorting algorithm?
algorithms
sorting
online-algorithms
Finding arcs between strongly connected components
algorithms
graphs
graph-theory
Knapsack problem question
algorithms
dynamic-programming
knapsack-problems
Is there any simpler way to have for each sequence element the amount of succeeding larger elements than to implement an AVL tree?
algorithms
discrete-mathematics
How to efficiently compute the most isolated point?
algorithms
graph-theory
computational-geometry
nearest-neighbour
Algorithm Suggestion for periodic alerts
algorithms
algorithm-analysis
search-problem
Levenshtein distance algorithm with bits
algorithms
dynamic-programming
Steiner tree problem with the known optimal subset of Steiner vertices in approximation algorithms
algorithms
approximation
Find a path that contains specific nodes without back and forward edges
algorithms
graphs
graph-theory
shortest-path
graph-traversal
A path modification problem in directed graphs
algorithms
graphs
routing
social-networks
Difference in bit vectors
algorithms
bit-manipulation
How can I assign cooks to customers?
algorithms
assignment-problem
Troubles understanding this Interval Scheduling question
algorithms
greedy-algorithms
scheduling
process-scheduling
intervals
Efficiently finding the maximum pairwise GCD of a set of natural numbers
algorithms
number-theory
Constructing a rectangle from triangles
algorithms
computational-geometry
Is the problem of traversing every vertex of a graph (not necessarily once) without crossing an edge more than once in P?
algorithms
complexity-theory
graphs
np-complete
np-hard
What is the most efficient way to compute factorials modulo a prime?
algorithms
efficiency
integers
Fibonacci Heap / Binomial Heap - Decrease Key
algorithms
data-structures
heaps
Online set filling with redistributions
algorithms
greedy-algorithms
online-algorithms
Maximum flow properties
algorithms
algorithm-analysis
network-flow
ford-fulkerson
Push Relabel Max Flow Topcoder Tutuorial Problems
algorithms
graphs
graph-theory
network-flow
Paper-based algorithm to find longest formula which is common to at least two formulas
algorithms
optimization
Is it decidable to detect a virus?
algorithms
algorithm-analysis
undecidability
decision-problem
halting-problem
Why do we use Bellman ford instead of Dijkstra's Algorithm?
algorithms
graphs
weighted-graphs
How to calculate number of nodes opened by BFS?
algorithms
algorithm-analysis
search-algorithms
search-trees
Work-stealing: where and how many to steal
algorithms
scheduling
threads
How to compute quotient subgroup efficiently?
algorithms
computer-algebra
group-theory
How to solve a polynomial of the form y = ax^3 + bx^2 + cx + d using the incremental algorithm in computer graphics
algorithms
graphics
polynomials
Appropriate algorithm or heuristic for task scheduling
algorithms
optimization
scheduling
process-scheduling
Comparing Algorithm Strategies
algorithms
algorithm-analysis
data-structures
Scheduling algorithm with waiting time and priority
algorithms
scheduling
Printing all paths of a tree and sorting the weight of edges
algorithms
complexity-theory
graph-theory
graph-traversal
Interval tree: find all intervals containing a given interval
algorithms
search-trees
intervals
Logistic model and Linear regression model
algorithms
Dynamic graph (?) - combination of connections between vertices that for each 3 exist min 1 edge
algorithms
graphs
dynamic-programming
Time complexity of computing binomial coefficients (with binary representation of integers)
algorithms
time-complexity
How can I determine an algorithm from a table of numbers?
algorithms
Uniformly randomly generating an "unlockable" graph
algorithms
graphs
Sorting a list of strings in lexicographic order of sorted strings
algorithms
sorting
strings
Dijkstra's algorithm: why are distances initialized to infinity and not some negative number?
algorithms
graphs
Boruvka MST algorithm using doubly linked lists
algorithms
graphs
minimum-spanning-tree
Is the SMA* algorithm optimal if and only if we have enough memory?
algorithms
artificial-intelligence
What is the best algorithm for multiple matches?
algorithms
How approximate sine using Taylor series
algorithms
approximation
numerical-algorithms
Down to Zero Hacker Rank Problem
algorithms
How to find the minimum required CPU to process the packets
algorithms
How to find the supremum of all the "good" (interior) polytopes for a given set of 3D points?
algorithms
optimization
linear-programming
convex-hull
Minimum number of vertices whose removal makes the graph an independent set
algorithms
np-hard
clique
parameterized-complexity
Trying to understand a way to split an AVL tree in O(log n)
algorithms
data-structures
binary-trees
search-trees
balanced-search-trees
How to Match Socks
algorithms
algorithm-design
Covering a complete graph with n copies of an arbitrary graph: NP-complete?
algorithms
complexity-theory
graphs
graph-theory
np-complete
Maximizing the weighted average value of a set of items by doubling the weight of a subset of items
algorithms
Why does the given solution to this problem works? How can it's correctness be proven?
algorithms
data-structures
greedy-algorithms
Calculating $\sum_{i=1}^a \lfloor a/i \rfloor i^2$
algorithms
number-theory
iteration
Is packing a bag of presents easier for Rupert than Santa?
algorithms
complexity-theory
optimization
packing
Do Nested Monte Carlo Algorithm always find the best score where score is the number of moves on the leftmost path
algorithms
algorithm-analysis
monte-carlo