Computer Science

Excavator

 Excavator
Edit first post that was inactive for 6 months.
Awarded 462 times.
Instruction Set Architecture (ISA) design
Awarded 23 hours ago
Can I simplify log(n+1) before showing that it is in O(log n)?
Awarded Feb 26 at 4:15
Is a balanced binary tree a complete binary tree?
Awarded Feb 22 at 4:17
Is “super-exponential” a precise definition of algorithmic complexity?
Awarded Feb 20 at 6:33
What's the difference between a stream and a queue?
Awarded Feb 18 at 4:20
Difference between Turing machine and Universal Turing machine
Awarded Feb 17 at 5:49
A reference for pseudocode for Monge-Elkan algorithm?
Awarded Jan 31 at 5:01
What is decider?
Awarded Jan 28 at 4:21
Finding Permutations with Exclusions
Awarded Jan 21 at 4:40
Solving the min edge cover using the maximum matching algorithm
Awarded Jan 19 at 5:21
Showing that deciding whether a given TM accepts a word of length 5 is undecidable
Awarded Jan 15 at 5:05
Understanding a paper on polynomial recursion in all finite types
Awarded Jan 7 at 4:52
Is the set of strings with equal number of 010’s and 101’s regular?
Awarded Jan 6 at 19:52
Dijkstra without decrease key
Awarded Dec 31 '20 at 4:37
Non-deterministic Büchi vs Rabin: Automaton size for LTL->automaton
Awarded Dec 30 '20 at 4:12
Algorithm to check whether a complete, undirected graph is fullfilling the triangle inequality
Awarded Dec 28 '20 at 4:16
Graphs that cause DFS and BFS to process nodes in the exact same order
Awarded Dec 28 '20 at 4:16
Is a Turing Machine “by definition” the most powerful machine?
Awarded Dec 21 '20 at 6:34
Are expert systems outdated, what are better alternatives to them, if any?
Awarded Dec 17 '20 at 4:48
A variant of travel salesman problem in grid graph
Awarded Dec 8 '20 at 4:55
How to prove the optimization version problem (whose decision version is NP-complete) can be solved in poly-time iff P=NP?
Awarded Nov 23 '20 at 4:05
Where does entanglement fit into quantum computing?
Awarded Nov 13 '20 at 6:50
Why is the Mersenne Twister regarded as good?
Awarded Nov 1 '20 at 4:33
Why does every member $f(n) \in \Theta(g(n))$, and $g(n)$ have to be asymptotically non-negative?
Awarded Oct 29 '20 at 6:16
Why is every finite language A ⊆ Σ* regular
Awarded Oct 29 '20 at 6:16
Example of two undecidable languages that cannot be mapping reduced to each other
Awarded Oct 29 '20 at 6:16
Checking if there is a single path that visits all nodes in a directed graph
Awarded Oct 23 '20 at 5:48
If the Halting Problem was solvable, and we solved it, what would be its implications?
Awarded Oct 23 '20 at 5:48
How to prove greedy algorithm is correct
Awarded Oct 17 '20 at 4:34
Counting the number of words accepted by an acyclic NFA
Awarded Oct 10 '20 at 4:56
Algorithm for checking if all subarrays have an unique element
Awarded Oct 7 '20 at 5:34
Decidability of dependent typing on primitive recursive languages
Awarded Sep 17 '20 at 5:37
Demonstrating that for every monotonic grammar there is an equivalent context-sensitive grammar
Awarded Sep 5 '20 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 '20 at 7:40
Red-black tree amortized cost of the rebalancing
Awarded Aug 25 '20 at 4:42
GATE CS 2009, question 11, does the grammar produce odd-length palindromes? [closed]
Awarded Aug 1 '20 at 4:48
aⁿbⁿcⁿdⁿ using 2-stack PDA
Awarded Jul 31 '20 at 5:02
What is the significance of negative weight edges in a graph?
Awarded Jul 25 '20 at 4:17
What is the purpose of Mark field in Fibonacci Heaps?
Awarded Jul 17 '20 at 5:10
The buckets of water problem
Awarded Jul 15 '20 at 5:22
How to reduce the number of crossing edges in a diagram?
Awarded Jul 7 '20 at 4:09
When is a bound asymptotically tight?
Awarded Jun 22 '20 at 4:15
Simple cycles of length two in an undirected graph
Awarded Jun 21 '20 at 6:06
Algorithmic intuition for logarithmic complexity
Awarded Jun 13 '20 at 4:22
Differences and relationships between randomized and nondeterministic algorithms?
Awarded Jun 9 '20 at 5:11
Am I right about the differences between Floyd-Warshall, Dijkstra and Bellman-Ford algorithms?
Awarded May 30 '20 at 4:37
Can we create faster sort algorithm than O(N log N)
Awarded May 27 '20 at 4:03
How does Tarjan's pseudocode work (explained to someone familiar with C or Java)?
Awarded May 25 '20 at 5:34
Maximizing book picked using two stacks
Awarded May 23 '20 at 18:50
Cache effective access time calculation
Awarded May 22 '20 at 8:12
Are the languages recognized by deterministic one-counter machines equivalent to deterministic context free language?
Awarded May 9 '20 at 4:17
How do I visit all edges incident to a vertex in a DCEL data structure?
Awarded May 5 '20 at 5:10
Why is the halting problem semi-decidable?
Awarded May 5 '20 at 5:10
How to count all integers less than a given integer and having two contigous digits as $y$?
Awarded May 3 '20 at 4:25
Minimize sum of squared error
Awarded May 1 '20 at 5:37
Express boolean logic operations in zero-one integer linear programming (ILP)
Awarded May 1 '20 at 5:37
Reduction from 3-SAT to a graph problem
Awarded Apr 30 '20 at 4:47
What is the definition of P, NP, NP-complete and NP-hard?
Awarded Apr 20 '20 at 4:16
Proving that $S^* = (S^*)^*$
Awarded Apr 19 '20 at 7:56
Proving that $S^* = (S^*)^*$
Awarded Apr 19 '20 at 7:56
1
2 3 4 5
…
8