Computer Science

Popular Question

 Popular Question
Question with 1,000 views. This badge can be awarded multiple times.
Awarded 9223 times.
Graph traversal problem touching every node exactly once
Awarded 40 mins ago
Using LP to prove the max matching - min cover theorem
Awarded 1 hour ago
Finding all unique paths from a source to a sink in a specially-formed DAG
Awarded 1 hour ago
How to prove LTL-formulas true for all paths?
Awarded 2 hours ago
EQ_{TM} is not Turing recognizable, but we can reduce A_{TM} to it?
Awarded 2 hours ago
Which one of the following is NOT a function of transport layer?
Awarded 9 hours ago
Pascal FOR loop with context free gramar
Awarded 10 hours ago
Why not polynomial-space reductions for $PSPACE$-hardness?
Awarded 18 hours ago
Array vs Linked List Implementation of Stacks (in JS)
Awarded 21 hours ago
How to find the number of intervals containing a point when given a static set of intervals?
Awarded 22 hours ago
Is the BPP class closed for union and intersection?
Awarded yesterday
Undecidability of REGULAR_TM (Detail within Proof)
Awarded yesterday
Proof of correctness of reversal algorithm for array rotation
Awarded yesterday
Proof that the Blank Tape Halting Problem is undecideable [duplicate]
Awarded 2 days ago
Does a time quantum affect priority non preemptive scheduling?
Awarded 2 days ago
Does DFS have better constants/complexity than Backtracking on a Graph?
Awarded 2 days ago
Regex for divisibility by 123 in binary strings
Awarded Dec 6 at 12:56
Can multiple tasks in an RTOS share one stack to save memory?
Awarded Dec 6 at 7:05
Is finding cache size possible with information given?
Awarded Dec 6 at 5:26
Bottom-up Mergesort vs Natural Merge Sort
Awarded Dec 6 at 1:27
How to setup the Bellman Equation as a linear system of equation
Awarded Dec 6 at 0:05
CFG that generates $1^*$ is decidable
Awarded Dec 5 at 22:07
Given a source and destination, find the path with minimum stress level in a Graph
Awarded Dec 5 at 17:45
When proving NP-completeness do I only need one instance of a problem or all of them?
Awarded Dec 5 at 17:11
Computer Security versions of the Halting Problem
Awarded Dec 5 at 14:33
Left-Right-Rotation of AVL-Tree
Awarded Dec 5 at 12:41
What is the difference between a fraction and a float?
Awarded Dec 5 at 10:45
Time complexity for calculating the $LPS$ array (failure function) in KMP algorithm preprocessing
Awarded Dec 5 at 7:11
How does Rogozhin's (2, 18) universal turing machine work?
Awarded Dec 5 at 0:05
NP-complete problem 3-SAT, is there a difference in complexity between just providing yes/no without exact solution
Awarded Dec 4 at 23:15
Complexity of insertion into a linked list, single vs double
Awarded Dec 4 at 22:40
The stability of log(1+x)
Awarded Dec 4 at 19:32
Averege time complexity of open addressing
Awarded Dec 4 at 19:03
Why does a software video encoder create higher quality output than a hardware video encoder
Awarded Dec 4 at 16:27
Reducing 3SAT to MAX-3SAT
Awarded Dec 4 at 16:04
When is a grammar ambiguous or When is a grammar not ambiguous?
Awarded Dec 4 at 13:19
Non-deterministic 2-tape Turing Machine that recognizes palindromes in linear time
Awarded Dec 4 at 6:35
Defining a Turing machine for $0^n 1^n 0^1$ [closed]
Awarded Dec 4 at 6:17
Proving the loop invariant for a simple program in Hoare logic
Awarded Dec 3 at 21:41
Is this a proper Max Heap Data Structure
Awarded Dec 3 at 21:35
If P = NP, then how not cannot solve NP-hardness (the one that doesn't intersect with NP-complete) in polynomial-time?
Awarded Dec 2 at 13:47
How to do -8 x -8 in a 4 bit booth multiplier?
Awarded Dec 2 at 8:47
How is this reduction of 3-SAT to Half-SAT not valid? [duplicate]
Awarded Dec 1 at 19:55
Is the halting problem undecidable or unrecognizable? [duplicate]
Awarded Dec 1 at 17:32
Design a Pushdown automaton for $L = \{a^nb^m | n \le m \le 3n \} $
Awarded Dec 1 at 15:15
Is following grammar LR(0)?
Awarded Dec 1 at 11:35
Can I apply Rice's theorem to decide decidability status of these languages?
Awarded Dec 1 at 6:04
What can't you do without Turing-completeness?
Awarded Dec 1 at 4:41
How to evaluate all possible groups of adjacent tiles in 2D array?
Awarded Nov 30 at 22:33
How does size of list in merge-sort, quick-sort, insertion-sort, matter?
Awarded Nov 30 at 21:57
Are Context Sensitive Languages Turing Complete? [duplicate]
Awarded Nov 30 at 19:35
Understanding the Linear speedup theorem and how strong it is
Awarded Nov 30 at 8:33
Is machine epsilon the largest relative error in representing a number as a floating point number?
Awarded Nov 29 at 19:56
Are LR(k) languages and DCFLs equivalent?
Awarded Nov 29 at 10:06
What are the things one can do with the internet without the World Wide Web? [closed]
Awarded Nov 29 at 6:40
Is determining if a Turing Machine stops for at least one entry decidable?
Awarded Nov 29 at 6:04
Mapping reduction from $A_{TM}$ to $INFINITE_{TM}$ same as to $ALL_{TM}$?
Awarded Nov 29 at 3:21
Find all values repeating more than $\lfloor n/k \rfloor$ times in $O(n \log k)$ time
Awarded Nov 28 at 22:34
Is the problem of determining whether a CFG generates a string in the form 0*1* decidable?
Awarded Nov 28 at 22:34
Loading a word from byte-addressable cache
Awarded Nov 28 at 20:05
1
2 3 4 5
…
154

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.