Computer Science

Excavator

 Excavator
Edit first post that was inactive for 6 months.
Awarded 437 times.
Checking if there is a single path that visits all nodes in a directed graph
Awarded yesterday
If the Halting Problem was solvable, and we solved it, what would be its implications?
Awarded yesterday
How to prove greedy algorithm is correct
Awarded Oct 17 at 4:34
Counting the number of words accepted by an acyclic NFA
Awarded Oct 10 at 4:56
Algorithm for checking if all subarrays have an unique element
Awarded Oct 7 at 5:34
Decidability of dependent typing on primitive recursive languages
Awarded Sep 17 at 5:37
Demonstrating that for every monotonic grammar there is an equivalent context-sensitive grammar
Awarded Sep 5 at 4:41
How to prove that {<M1, M2> : M1 and M2 are two DFAs and L(M1) $\neq$ L(M2)} is in NL?
Awarded Sep 4 at 7:40
Red-black tree amortized cost of the rebalancing
Awarded Aug 25 at 4:42
GATE CS 2009, question 11, does the grammar produce odd-length palindromes? [closed]
Awarded Aug 1 at 4:48
aⁿbⁿcⁿdⁿ using 2-stack PDA
Awarded Jul 31 at 5:02
What is the significance of negative weight edges in a graph?
Awarded Jul 25 at 4:17
What is the purpose of Mark field in Fibonacci Heaps?
Awarded Jul 17 at 5:10
The buckets of water problem
Awarded Jul 15 at 5:22
How to reduce the number of crossing edges in a diagram?
Awarded Jul 7 at 4:09
When is a bound asymptotically tight?
Awarded Jun 22 at 4:15
Simple cycles of length two in an undirected graph
Awarded Jun 21 at 6:06
Algorithmic intuition for logarithmic complexity
Awarded Jun 13 at 4:22
Differences and relationships between randomized and nondeterministic algorithms?
Awarded Jun 9 at 5:11
Am I right about the differences between Floyd-Warshall, Dijkstra and Bellman-Ford algorithms?
Awarded May 30 at 4:37
Can we create faster sort algorithm than O(N log N)
Awarded May 27 at 4:03
How does Tarjan's pseudocode work (explained to someone familiar with C or Java)?
Awarded May 25 at 5:34
Maximizing book picked using two stacks
Awarded May 23 at 18:50
Cache effective access time calculation
Awarded May 22 at 8:12
Are the languages recognized by deterministic one-counter machines equivalent to deterministic context free language?
Awarded May 9 at 4:17
How do I visit all edges incident to a vertex in a DCEL data structure?
Awarded May 5 at 5:10
Why is the halting problem semi-decidable?
Awarded May 5 at 5:10
How to count all integers less than a given integer and having two contigous digits as $y$?
Awarded May 3 at 4:25
Minimize sum of squared error
Awarded May 1 at 5:37
Express boolean logic operations in zero-one integer linear programming (ILP)
Awarded May 1 at 5:37
Reduction from 3-SAT to a graph problem
Awarded Apr 30 at 4:47
What is the definition of P, NP, NP-complete and NP-hard?
Awarded Apr 20 at 4:16
Proving that $S^* = (S^*)^*$
Awarded Apr 19 at 7:56
Proving that $S^* = (S^*)^*$
Awarded Apr 19 at 7:56
$UCYCLE$ is in $L$
Awarded Apr 13 at 4:20
Hash size: Are prime numbers “near” powers of two a poor choice for the modulus?
Awarded Apr 9 at 4:55
Product construction for given two finite automata
Awarded Apr 1 at 4:20
Is it possible to do Dependent Types in Typed Racket?
Awarded Mar 25 at 5:20
Construct Turing Machine which accepts the language $ww$
Awarded Mar 25 at 5:20
Quicksort Partitioning: Hoare vs. Lomuto
Awarded Mar 25 at 5:20
Difference between page table and inverted page table
Awarded Mar 24 at 5:05
Can one show NP-hardness by Turing reductions?
Awarded Mar 23 at 4:20
Floyd's Cycle detection algorithm | Determining the starting point of cycle
Awarded Mar 20 at 4:15
How to use adversary arguments for selection and insertion sort?
Awarded Mar 18 at 4:15
Proof of decidability of determining whether a DFA accepts a string
Awarded Mar 11 at 4:55
Knapsack Greedy Approximation: Worst Case
Awarded Mar 2 at 4:10
When would best first search be worse than breadth first search?
Awarded Mar 1 at 4:10
Algorithm for decomposing a complex (self-intersecting) polygon into simple polygons
Awarded Feb 26 at 4:45
Context free grammar for a palindrome of even length + cc
Awarded Feb 24 at 4:20
Updating the distances matrix after single edge was decreased
Awarded Feb 16 at 4:50
What is an IELR(1)-parser?
Awarded Jan 23 at 6:00
Why is quicksort better than other sorting algorithms in practice?
Awarded Jan 23 at 6:00
Why a separate ALU is needed, since any integer can be represented as floating point numbers?
Awarded Jan 18 at 4:35
Whether TM accepts epsilon?
Awarded Jan 17 at 4:35
Image convolution - image darkens
Awarded Jan 11 at 4:05
Proof of Space Hierarchy Theorem incompatible with Linear Speed Up Theorem for time
Awarded Dec 29 '19 at 4:30
Graph find all vertices that are part of a cycle
Awarded Dec 28 '19 at 5:05
Divide N sticks among M boys as homogeneously as possible (ignoring order)
Awarded Dec 24 '19 at 4:45
Mapping intuitionistic logic to the modal logic S4
Awarded Dec 18 '19 at 5:10
What is the simplest known NP-Complete problem for testing P=NP solutions? [closed]
Awarded Dec 15 '19 at 6:50
1
2 3 4 5
…
8