<we><edit> <!-- questions and answers -->
correctness-proof
image-processing
cryptography
heuristics
time-complexity
data-compression
np-complete
quantum-computing
greedy-algorithms
scheduling
computation-models
undecidability
parsers
hash-tables
computer-vision
np-hard
reductions
reference-request
graphs
proof-techniques
graph-theory
terminology
optimization
automata
parallel-computing
Computer Science
students, researchers and practitioners of computer science
User
70.603
Votes
215.470
Comments
148.716
Questions
25.248
Answers
30.200
Solved Questions
11.635
Unsolved Questions
4.764
correctness-proof
image-processing
cryptography
heuristics
time-complexity
data-compression
np-complete
quantum-computing
greedy-algorithms
scheduling
computation-models
undecidability
parsers
hash-tables
computer-vision
np-hard
reductions
reference-request
graphs
proof-techniques
graph-theory
terminology
optimization
automata
parallel-computing
lower-bounds
search-trees
computer-architecture
satisfiability
regular-languages
network-flow
recursion
concurrency
probability-theory
functional-programming
database-theory
efficiency
computational-geometry
complexity-classes
computer-networks
distributed-systems
operating-systems
machine-learning
compilers
complexity-theory
type-theory
space-complexity
decision-problem
nondeterminism
halting-problem
logic
artificial-intelligence
search-algorithms
closure-properties
circuits
data-structures
lambda-calculus
randomized-algorithms
recurrence-relation
binary-trees
computability
programming-languages
strings
arrays
algorithm-analysis
weighted-graphs
algorithms
arithmetic
landau-notation
hash
memory-management
graph-traversal
matrices
regular-expressions
context-free
formal-languages
linear-programming
asymptotics
shortest-path
sorting
sets
neural-networks
randomness
pushdown-automata
finite-automata
combinatorics
np
turing-machines
polynomial-time
formal-grammars
cpu-cache
runtime-analysis
trees
linear-algebra
information-theory
discrete-mathematics
approximation
dynamic-programming
pumping-lemma
number-theory
reinforcement learning in gridworld with subgoals
machine-learning
reinforcement-learning
Confluent directed acyclic graph
graph-theory
How to Compute Lowpt(v) in a DFS Tree, where Lowpt(v)={w| there exist a back_edge xw, such that x is a descendant of v}?
algorithms
graphs
graph-theory
algorithm-analysis
graph-traversal
Convert a string consisting of only digits into an integer array such that the elements form a Fibonacci sequence based on the indices
algorithms
Is it NP complete to decide whether a partition of $V=(V_1, V_2)$ exists such that $\delta(G(V_1))\le 2 $ and $\delta(G(V_1))\le 3 $?
np-complete
Maximum sum Sequence such that no two elements are adjacent
algorithms
dynamic-programming
subsequences
Steiner tree problem with the known optimal subset of Steiner vertices in approximation algorithms
algorithms
approximation
multiple sequence alignment using HMM and simulated annealing
hidden-markov-models
bioinformatics
If2P(16,r)=P(16,r+2),then find r
combinatorics
discrete-mathematics
permutations
How would a priority queue be implemented in a functional programming language?
functional-programming
priority-queues
Find a path that contains specific nodes without back and forward edges
algorithms
graphs
graph-theory
shortest-path
graph-traversal
Provide me the algorithm on insertion sort of element
algorithms
Demonstrate that algorithm is O(n)
complexity-theory
time-complexity
asymptotics
recursion
Is it NP complete to decide whether there exists a subset of V of size at most $k$ hitting all maximal bicliques of G?
complexity-theory
graphs
np-complete
reductions
How to deal with cost variation in a dynamic graph when applying Dijkstra
graphs
graph-theory
shortest-path
graph-traversal
Resource Allocation Graph: Two processes want the same resource
graph-theory
resource-allocation
Comb Sort Best Case
data-structures
sorting
Language of all words accepted by a TM by at most $t$ steps is regular
turing-machines
computability
regular-languages
How does a computer know a light is on (binary)?
computer-architecture
digital-circuits
Binary Exponential Backoff
computer-networks
If $L = \{ a^{2^n} \mid n \ge 0 \} $ is not regular, then why there is a DFA thats accepts its language?
formal-languages
regular-languages
Minimum cost to convert one array to another
algorithms
optimization
arrays
Why do we not use CFGs to describe the structure of lexical tokens?
context-free
formal-grammars
regular-expressions
lexical-analysis
circle selection
complexity-theory
sets
information-theory
A path modification problem in directed graphs
algorithms
graphs
routing
social-networks
Alan Perlis Epigram on Recursion
computability
recursion
Sorting by Comparisons Proof
algorithms
sorting
Making a CFL for a^i b^j c^k such that i+j = 3k
context-free
formal-grammars
pushdown-automata
Algorithm to find best combination of datasources (Quality and price)
algorithms
Binary Tree Node Insertion
binary-trees
binary-search-trees
Call by value, call by reference , call by value result
programming-languages
Is $P\neq NP\iff 3SAT$ not reducible to LP?
linear-programming
3-sat
Is $\{0,1\}$ LP and $[0,1]$ LP directly reducible to $3SAT$?
linear-programming
3-sat
Transitivity of quasi-reducibility
computability
reductions
Why don't we delete a node in adjacency list after visiting an edge in Fleury algorithm?
algorithms
graphs
What is a reducible flow graph?
graphs
graph-theory
network-flow
How can I assign cooks to customers?
algorithms
assignment-problem
Troubles understanding this Interval Scheduling question
algorithms
greedy-algorithms
scheduling
process-scheduling
intervals
How to feed videos to a neural network
neural-networks
data-sets
video
Calculating the set field of associative cache
cpu-cache
Runtime analysis of while-loop analysis
algorithms
algorithm-analysis
asymptotics
runtime-analysis
loops
Finding the Diameter, Radius and Eccentricities of G
algorithms
graphs
What do Arora and Barak mean by $x|_S$ in their definition of certificate complexity?
complexity-theory
decision-tree
Finding a Simple Distribution In a Binary String
machine-learning
pattern-recognition
is P_CTC = BPP_PATH?
complexity-theory
complexity-classes
quantum-computing
is it possible to determine using a single depth-first search, in O(V+E) time, whether a directed graph is singly connected?
graphs
graph-theory
graph-traversal
If Q1 and Q2 are countably enumerable, then is Q1\Q2 countably enumerable?
computability
semi-decidability
What is the runtime of binary search on a continuous function?
algorithm-analysis
runtime-analysis
approximation
binary-search
Which OS component is in charge of searching for free memory?
memory-management
virtual-memory
os-kernel
Efficiently finding the maximum pairwise GCD of a set of natural numbers
algorithms
number-theory
Object qualification algorithm
algorithms
Is the outer loop in typical bubble sort algorithm precise?
algorithms
sorting
Variable bytes (bit arrays) and flipping single bits?
strings
computation-models
arrays
bit-manipulation
Show that the set $\{uv | u \in L \ and\ v \notin L\}$ is regular
regular-languages
closure-properties
The recursive solution to the all-pairs shortest-paths of Floyd-Warshall algorithm
algorithms
graphs
shortest-path
Does Floyd–Warshall work on all graphs?
algorithms
graphs
shortest-path
How does in-order traversal in Binary search tree works (recursion)
binary-trees
recursion
Are the implications of the diagonalization language different from those of the halting problem?
turing-machines
computability
undecidability
halting-problem
Find the nearest sum to a given number of two elements in sorted matrix
algorithms
optimization
arrays
matrices
nearest-neighbour
Proving the correctness of a square summing algorithm
recursion
induction
Understanding Bellman-Ford and Floyd-Warshall Algorithms as Dynamic Programming Algorithms
algorithms
graphs
graph-theory
dynamic-programming
shortest-path
What does software data look like?
computer-networks
Better algorithm for aggregating data from various LDAP systems
data-structures
search-algorithms
search
Fibonacci Heap / Binomial Heap - Decrease Key
algorithms
data-structures
heaps
$O(n\log n)$- algorithm for finding tree root
algorithms
algorithm-analysis
data-structures
trees
binary-trees
Efficient streaming sort
algorithms
algorithm-analysis
sorting
mathematical-programming
streaming-algorithm
Why can't a compiler create universal N-bit code (e.g. 32-bit, 64-bit, etc.)
computer-architecture
compilers
Reducing INDSET and MAXCUT to 3SAT
np-complete
reductions
satisfiability
np
max-cut
Simulating Turing Machine with writing only on non-input fields on read-only Turing machine
complexity-theory
computability
turing-machines
Nearest codeword in a translation-invariant code over $\mathbb{Z}^d$
computability
undecidability
coding-theory
computer-algebra
Computational Complexity of Solutions of the Traveling Purchaser Problem on a Small Data Set
algorithms
complexity-theory
algorithm-analysis
time-complexity
np-hard
How to prove that the language { ww | w ∈ {a,b}* } is / isn't context free?
formal-languages
context-free
pumping-lemma
Online set filling with redistributions
algorithms
greedy-algorithms
online-algorithms
language accepted by DFA
automata
finite-automata
Name for number of branches of a tree
trees
Is there way to calculate $\sum_{i<j<k\leq n} A_i \cdot A_j \cdot A_k$ faster than $O(n^3)$
algorithms
mathematical-programming
Data structure optimized for merging maps on partitions
data-structures
runtime-analysis
Do the classes $P$ and $NP$ include problems faster then polynomial?
complexity-theory
terminology
Miss penalty for Write request in a Write-Back style system
computer-architecture
cpu-cache
Subtlety of a bar in introduction rule
logic
High Level Assemblers vs Compilers?
terminology
compilers
What is the difference between a block and a procedure?
lisp
video shape recognition in real time
optimization
computational-geometry
pattern-recognition
Validating attempt on NFA to Regular Expression
finite-automata
regular-expressions
Vertex degrees of planar graphs
graphs
graph-theory
planar-graphs
Union of two non-context-free languages
algorithms
context-free
Data Structure - Array of Array
algorithms
algorithm-analysis
data-structures
Runtime analysis of prime-set computation
algorithm-analysis
runtime-analysis
Does the Working Set Paging Algorithm use a separate page table?
virtual-memory
paging
The "complexity" of the Turing machine state specification
complexity-theory
turing-machines
time-complexity
Fuzzy, nonsequential string search algorithm?
algorithms
search-algorithms
How to prove the existence of a number which cannot be written by any algorithm?
algorithms
reductions
halting-problem
Manipulating Adjacency matrix
algorithms
adjacency-matrix
Segment-tree construction: do we recurse into both children?
search-trees
intervals
Backward mapping with bilinear sampler
neural-networks
computer-vision
image-processing
sampling
Is there an algorithm to detect race conditions in logic circuits?
algorithms
logic
Provide a derivation from backwards on?
logic
How does reducing the Halting problem prove the reduction cannot exist?
turing-machines
halting-problem
Why is the Turing Machine a popular model of computation?
turing-machines
computation-models
Algorithm Comparison with Theta-notation
algorithm-analysis
asymptotics
runtime-analysis