Computer Science

Notable Question

 Notable Question
Question with 2,500 views. This badge can be awarded multiple times.
Awarded 4222 times.
Does CPU without register exist?
Awarded 2 hours ago
Finding the nodes that have degree at least 3 in an undirected graph
Awarded 5 hours ago
Prove that the equal-length concatenation of regular languages is context free
Awarded 18 hours ago
Finding k-nearest neighbors to a set of nodes in a large graph
Awarded 23 hours ago
Concatenation of two Turing machines
Awarded yesterday
How to understand the complexity of Kruskal implemented with Quick-Union by rank and path compression?
Awarded yesterday
Why in Flow network, there is no reversed edges?
Awarded yesterday
Why is deciding regularity of a context-free language undecidable?
Awarded yesterday
Certificates and NP?
Awarded 2 days ago
Finding recurrence relation for running time of an algorithm
Awarded Dec 8 at 9:15
Greater than or equal to operation (32-bit ALU)
Awarded Dec 8 at 8:33
Big O notation for Average case in Linear search
Awarded Dec 8 at 7:27
What does it mean for a grammar to be LR(0)?
Awarded Dec 7 at 15:21
Can we check in polynomial time if the language of a DFA is closed against Kleene star?
Awarded Dec 6 at 17:41
A schedule is not conflict-serializable. Is it serializable?
Awarded Dec 5 at 13:06
Size comparison of NFA and minimal DFA [duplicate]
Awarded Dec 4 at 23:55
half precision floating point multiplication
Awarded Dec 4 at 11:06
Does the Minimum Spanning Tree include the TWO lowest cost edges?
Awarded Dec 3 at 15:00
Happened-before and Causal order
Awarded Dec 1 at 22:56
What are the meanings of metalanguage and metasyntax and EBNF?
Awarded Dec 1 at 15:10
Shortest path with a start vertex that touches all nodes at least once with repeats allowed
Awarded Dec 1 at 0:33
is an empty string accepted by this NFA accepters
Awarded Nov 30 at 20:19
Independent set poly reducible to Strongly independent set?
Awarded Nov 30 at 16:49
How come the branching factor of chess is 35?
Awarded Nov 29 at 9:28
Proof that shortest path with negative cycles is NP hard
Awarded Nov 28 at 4:03
Technique for converting recursive DP to iterative DP
Awarded Nov 27 at 16:10
What does distinct mean in terms of an array? [closed]
Awarded Nov 27 at 14:03
How to construct the objective function for genetic algorithm optimization?
Awarded Nov 27 at 4:17
What is the fastest way to merge two B trees?
Awarded Nov 25 at 20:35
Show that any monotone Boolean function is computable by a circuit containing only AND and OR gates
Awarded Nov 25 at 6:35
Regex for string does not contain the substring "110"
Awarded Nov 24 at 11:47
Can any known sub-Turing-complete model of computation enumerate precisely the set of prime numbers?
Awarded Nov 24 at 1:12
co-NP but not NP problems
Awarded Nov 22 at 3:32
Find a maximum matching in linear time
Awarded Nov 21 at 10:21
How to read BNF syntax of C?
Awarded Nov 21 at 8:16
CPU and GPU differences
Awarded Nov 21 at 4:17
When binary search algorithm will be $O(1)$
Awarded Nov 20 at 19:00
Why is it meaningless to say the runtime of an algorithm is at least in the order of n squared?
Awarded Nov 20 at 14:03
Confirmation of alternative correctness proof for Floyd-Warshall's all-pair shortest-path algorithm
Awarded Nov 19 at 20:27
Find candidate keys given functional dependencies
Awarded Nov 16 at 10:51
DFA for even number of 1's
Awarded Nov 16 at 7:43
Are the implications of the diagonalization language different from those of the halting problem? [duplicate]
Awarded Nov 14 at 14:10
Does an algorithm's space complexity include input?
Awarded Nov 14 at 13:33
Simple graph canonization algorithm
Awarded Nov 14 at 7:19
Is the language $a^i b^j c^k$ with $i+j > k$ context-free?
Awarded Nov 13 at 23:48
What is the simplest algorithm to compress a string?
Awarded Nov 13 at 13:11
Arbitrary precision integer square root algorithm?
Awarded Nov 12 at 22:15
residual graph and augmenting path in max flow
Awarded Nov 12 at 21:56
Is it possible to produce different shortest path trees using bellman ford and Dijkstra algorithm?
Awarded Nov 12 at 19:41
Tiling an orthogonal polygon with squares
Awarded Nov 11 at 22:11
Closest pair of points in 3D
Awarded Nov 11 at 21:05
Can we use Convolutional Neural Network for dataset containing numeric data? [closed]
Awarded Nov 11 at 17:27
How can I show that the Cook-Levin theorem does not relativize?
Awarded Nov 11 at 6:10
Min-coin change problem with limited coins
Awarded Nov 11 at 1:20
Connected Graph: Select the minimum number of nodes such that the node and neighbor covers everything
Awarded Nov 9 at 14:27
Difference between multi-tape Turing machine and single tape machine
Awarded Nov 9 at 7:56
Why is quiescent consistency compositional, but sequential consistency is not
Awarded Nov 9 at 7:30
How do you prove a heuristic is admissible?
Awarded Nov 7 at 18:02
Reduction from PARTITION to MAX-CUT
Awarded Nov 7 at 5:06
Would it make sense to use an array of linked lists for a Priority Queue, given a fixed number of priorities?
Awarded Nov 5 at 20:10
1
2 3 4 5
…
71

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.