Computer Science

Editor

 Editor
First edit.
Awarded 13805 times.
Why aren't P and P/poly trivially the same?
Awarded 5 hours ago
Desired outcome calculation in a single player game
Awarded yesterday
How can an instruction be fetched every cycle?
Awarded yesterday
Adding two numbers in half-precision IEEE754 standart
Awarded yesterday
Algorithms question: Largest contiguous subset selection
Awarded 2 days ago
Does there exist a language O such that $NL^O= Dtime(n^{logn})^O$? How to proceed with the proof in either case?
Awarded 2 days ago
Algorithm to find approximate position of element from a noisy sorted list
Awarded 2 days ago
Hardness result for online matching
Awarded Sep 13 at 14:55
How to count occurences in a Skiplist
Awarded Sep 13 at 7:35
Is Desmos Turing-Complete?
Awarded Sep 12 at 4:56
Efficient random sampling from large discrete distribution
Awarded Sep 11 at 17:41
(post deleted or otherwise unavailable)
Awarded Sep 11 at 13:18
Algorithm for slicing multidimensional array [closed]
Awarded Sep 10 at 8:27
(post deleted or otherwise unavailable)
Awarded Sep 9 at 15:56
Finding optimal path for a reproduction problem
Awarded Sep 9 at 14:08
A formal proof of Arden's Theorem [duplicate]
Awarded Sep 9 at 8:40
Tuple relational calculus: existential quantifiers
Awarded Sep 9 at 1:41
How does editing software (like Microsoft word or Gmail) pick the 2nd string to compare in Levenshtein distance?
Awarded Sep 8 at 22:42
Doubt regarding the physical folding of a two dimensional K-map
Awarded Sep 8 at 5:40
How does clients observe different replicas and stale data even if the replicas include same set of updates?
Awarded Sep 7 at 18:34
Flow-based vs. Reactive programming paradigms
Awarded Sep 7 at 18:01
Why is quadratic programming used to the solve the support vector machine optimization problem instead of the analytic approach?
Awarded Sep 7 at 15:02
How to get the numbers in the Sieve of Eratosthenes with wheel factorisation?
Awarded Sep 7 at 12:42
(post deleted or otherwise unavailable)
Awarded Sep 7 at 2:56
Reduction of K-Vertex-Cover to SAT: How to define the constraint?
Awarded Sep 6 at 19:02
Amortized Analysis of extract-min-operation of Fibonacci Heap
Awarded Sep 6 at 12:03
Proving existence of an optimal substructure for the DP problem "Sherlock and Cost" from HackerRank
Awarded Sep 6 at 11:41
(post deleted or otherwise unavailable)
Awarded Sep 6 at 10:56
How does editing software (like Microsoft word or Gmail) pick the 2nd string to compare in Levenshtein distance?
Awarded Sep 6 at 8:31
Check if there is a subset of coordinates where each coordinate in the subset is diagonal to each other
Awarded Sep 6 at 3:26
NP-hardness proof of an optimization problem with real values and rational input in the decision problem
Awarded Sep 6 at 0:25
Why some codes can be executed by creating an object file through compiler while some codes need an interpreter to be executed?
Awarded Sep 5 at 19:12
Connectivity in Directed Graph
Awarded Sep 5 at 10:42
Is this variant of the pinwheel scheduling NP-Hard?
Awarded Sep 5 at 8:56
How to arrive at correct preconditions and postconditions?
Awarded Sep 4 at 14:04
Axiomatic Geometry expressed with algebraic data types & functions
Awarded Sep 4 at 12:03
What is the smallest value of x for which this holds?
Awarded Sep 4 at 9:49
my dsa teacher gave a assignment which is really confusing (i asked my teacher about it but she said just google it and find it out yourself) [closed]
Awarded Sep 4 at 5:37
(post deleted or otherwise unavailable)
Awarded Sep 2 at 20:56
Constraining function inputs; what concept/terminology am I looking for?
Awarded Sep 2 at 12:15
Making use of one function to recursively find n/3 of another
Awarded Sep 2 at 1:05
Proving O(log n) bound for the number of iterations when we select the average as the pivot
Awarded Sep 1 at 14:34
Can a grammar that has only one leftmost derivation tree for every sentence, have more than one rightmost derivation tree for some sentence?
Awarded Sep 1 at 13:04
Can one brute force entries to create the whole file?
Awarded Sep 1 at 7:25
How to use pumping lemma on languages that do not follow a strict structure?
Awarded Sep 1 at 4:27
How does $Θ(\log(n!))=Θ(\log(n^n)$?
Awarded Aug 31 at 9:45
Can I multiply Big-O time complexities?
Awarded Aug 31 at 9:45
(post deleted or otherwise unavailable)
Awarded Aug 31 at 8:21
Computation branches on NTM
Awarded Aug 31 at 5:56
Looking for a multi-processor job scheduling strategy simulator
Awarded Aug 31 at 5:06
Can I multiply Big-O time complexities?
Awarded Aug 30 at 23:06
Is non-equivalence of regular expressions with union, concatenation and squaring NEXPTIME-hard?
Awarded Aug 30 at 17:06
"Universe-shrinking" function in Agda
Awarded Aug 30 at 16:56
(post deleted or otherwise unavailable)
Awarded Aug 30 at 15:42
What's the time complexity of finding all size-$k$ combinations from a set of size $n$?
Awarded Aug 30 at 3:50
Counting number of swaps to make two strings equal in linear time
Awarded Aug 29 at 8:50
How does $Θ(\log(n!))=Θ(\log(n^n)$?
Awarded Aug 29 at 6:48
(post deleted or otherwise unavailable)
Awarded Aug 29 at 5:10
Need help with a Minimum Window problem using the python language. Only the min_window function needs fixing
Awarded Aug 28 at 20:57
(post deleted or otherwise unavailable)
Awarded Aug 28 at 12:40
1
2 3 4 5
…
231

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.