Computer Science

Scholar

 Scholar
Ask a question and accept an answer.
Awarded 11245 times.
Select a subset of k intervals which form maximum length if we take union of these k intervals
Awarded yesterday
Proving that there is no solution to the PCP problem using induction
Awarded yesterday
If we have f(n) ∈ O(h(n)) and g(n) ∈ Ω(h(n)), does that mean that f(n) + g(n) ∈ Θ(h(n))?
Awarded 2 days ago
Does a non-deterministic Turingmachine reach every possible result?
Awarded Mar 22 at 18:56
Question about the length of certificate of an polynommial-time verifier
Awarded Mar 22 at 12:57
Is One Way TSP NP-Complete?
Awarded Mar 22 at 11:21
Is the language with at least as many 0 as 1 on any prefix $\omega$ regular?
Awarded Mar 22 at 7:42
What is the difference in heap configurations? Separation logic with CVC5 SMT solver
Awarded Mar 21 at 14:27
Checking forbidden moves in Renju
Awarded Mar 21 at 10:25
Is $n^n$ is a big-oh n factorial
Awarded Mar 20 at 20:34
Finding the Equation for Potential Method and Amortization Analysis
Awarded Mar 20 at 6:18
Find the asymptotic bound for the recurrence relation: $T(n) = T(\sqrt{n}) + 5n$
Awarded Mar 20 at 5:10
How to determine agreement between two sentences?
Awarded Mar 18 at 15:12
Sorting array of strings (with repetitions) according to a given ordering
Awarded Mar 15 at 23:27
Minimum amount of parties containing round tables for everyone to meet each other
Awarded Mar 15 at 21:18
Strictness in both arguments but not in each individually
Awarded Mar 15 at 17:11
DFA that accepts strings whose 10th symbol from the right end is 1
Awarded Mar 15 at 7:05
Determine bijective mapping using minimal number of lookups in subset mapping - standard problem / perspectives?
Awarded Mar 14 at 20:55
Help with time complexity of a given code
Awarded Mar 14 at 18:56
How does a Turing machine read a transition table as a function?
Awarded Mar 14 at 18:40
Route planning on line segments which can be connected or not
Awarded Mar 14 at 13:34
Is there a "Standard Algorithm" language, as used in academic papers?
Awarded Mar 14 at 13:26
Subquadratic multiplication of polynomials in the max-plus/tropical semiring
Awarded Mar 14 at 12:26
Algorithm/heuristic for large tournament matchup pairings
Awarded Mar 13 at 19:35
How do you calculate the amount of iterations the loop "for (i = 1; i < n^3; i += n)"
Awarded Mar 13 at 13:21
What is a contracting grammar (in opposition to a non-contracting grammar)?
Awarded Mar 13 at 2:09
Can we prove the greedy algorithm archives 1.5-approximation for the Minimal Dominating Set Problem?
Awarded Mar 12 at 13:11
Shuffling two related sets together
Awarded Mar 11 at 18:16
Compute the schedule which gives the maximum number of points
Awarded Mar 11 at 17:07
Transform a non-regular language into a regular one using sort
Awarded Mar 11 at 14:15
Can we transfer every DFA to DFAs with start state having no in edge?
Awarded Mar 11 at 12:50
How much does proving that a special case of a problem is NP-complete tell me about if the general problem is NP-complete?
Awarded Mar 10 at 22:49
Is there an algorithm to test for an acyclic undirected graph, using edge data, not node data (e.g. adjacency matrix)
Awarded Mar 10 at 14:09
Why NP is not certain subset in P/poly?
Awarded Mar 10 at 9:47
Monad in Haskell programming vs. Monad in category theory
Awarded Mar 10 at 0:22
Why is this proof that CHESS is in EXPTIME correct?
Awarded Mar 9 at 19:11
Geometric Set Cover in one dimension
Awarded Mar 7 at 23:26
How to show a language is in NP?
Awarded Mar 7 at 21:34
Is there a typo in this excerpt from the book?
Awarded Mar 7 at 11:08
Reddiag being a calculable function (Gödel, Escher, Bach)
Awarded Mar 5 at 12:25
Race condition, my doubt on Peterson's algorithm vs. C
Awarded Mar 4 at 15:43
How to schedule ELO-based, fair games with n players and dynamic teams?
Awarded Mar 2 at 17:40
Finding the nodes in the source and sink side of a min-cut
Awarded Mar 2 at 1:50
Dynamic programming: optimal order to answer questions to score the maximum expected marks
Awarded Mar 1 at 10:58
Is there an optimisation algorithm that does not require a good initial solution?
Awarded Feb 28 at 7:40
Ackermann Function without Recursion or Stack
Awarded Feb 28 at 4:45
Is it true that $R.L^* + L^* = R + L^*$?
Awarded Feb 26 at 14:50
Algorithm to determine the regularity of a language
Awarded Feb 26 at 13:35
How to determine if a set of edges is an edge cut of a graph?
Awarded Feb 26 at 8:50
Add minimum numbers of edges to the graph for the existence of an eulerian path
Awarded Feb 24 at 17:42
Why is 3-co-SAT not in P?
Awarded Feb 24 at 0:42
What are non-isomorphic NFAs
Awarded Feb 23 at 22:02
Can someone help me understand this Turing Machine?
Awarded Feb 23 at 16:57
Which algorithm solves the single-pair shortest path in a weighted directed cyclic graph?
Awarded Feb 21 at 17:30
number of substrings in same position with same contents
Awarded Feb 19 at 20:47
Possibly Tractable Variation of Suguru Puzzles
Awarded Feb 19 at 19:56
Scheduling jobs with two people where part (a) of each job must be finished before part (b)
Awarded Feb 18 at 0:56
Can Sutner's (1991) quadratic algorithm for testing reversibility of Cellular Automata be applied to 1-D CA with even sized neighborhoods?
Awarded Feb 17 at 17:06
Correct defintion polynomial-time reduction
Awarded Feb 16 at 21:42
Querying a binary search tree, find maximum
Awarded Feb 16 at 19:42
1
2 3 4 5
…
188

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.