Computer Science

Help Center > Badges > Scholar

 Scholar
Ask a question and accept an answer.
Awarded 8324 times.
Probability of detecting errors in codewords
Awarded 5 hours ago
What's the meaning of this service specification
Awarded 16 hours ago
How to write grammar production rules to describe recursive structures?
Awarded 23 hours ago
Can polynomial many-to-one reduction be done to a specific problem instance?
Awarded yesterday
Weighted Average of Multi-Output Neural Networks
Awarded yesterday
How to convert a Turing Machine program to a tiling using Wang Tiles?
Awarded yesterday
How to convert a centralized algorithm to a distributed algorithm?
Awarded yesterday
Dynamic length of union of segments (1d Klee's measure problem)
Awarded 2 days ago
Determine aproximation factor in a greedy algorithm
Awarded 2 days ago
Test if there exists an integer k to add to one sequence to make it a subsequence of another sequence
Awarded 2 days ago
How to find number of combinations of choosing one from k subsets
Awarded 2 days ago
Convert ambiguous grammar to unambiguous and SLR(1)
Awarded Dec 11 at 16:40
How to prove Exact cover problem is NP Complete using Vertex Cover problem?
Awarded Dec 11 at 16:40
Voronoi Cell and Voronoi Diagram
Awarded Dec 10 at 19:00
Does any algorithm loops at some point?
Awarded Dec 10 at 16:40
How to make single cycle processor pipelined?
Awarded Dec 10 at 0:30
Proof that $(L_{all})^C$ is not recursively enumerable
Awarded Dec 9 at 19:55
Data structure to report all axis aligned bounding boxes intersecting an axis aligned query line
Awarded Dec 9 at 19:25
If A is polynomial time reducible to B and B is in NP, then A is in NP
Awarded Dec 9 at 13:10
Converting DFA to RE with Arden's Rule
Awarded Dec 9 at 9:00
Converting connected graph to disconnected graph by removing minimum vertices
Awarded Dec 9 at 4:45
Can someone pelase give a counter example of it? If a problem is in NP then there is no known polynomial time algorithm to solve it
Awarded Dec 8 at 22:35
Finding maximal cardinal independent set given oracle
Awarded Dec 8 at 22:00
Given a set of sets, what is the largest common intersection between them?
Awarded Dec 8 at 20:50
CTL formula for “for every computation it is always possible to return to the initial state”
Awarded Dec 8 at 14:30
Is checking if the length of a C program that can generate a string is less than a given number decidable?
Awarded Dec 8 at 8:25
Finding a vertex coverage that is also an independent set
Awarded Dec 8 at 6:15
Minimum edge weight k-exact cover with triangle inequality
Awarded Dec 8 at 0:10
Which sort algorithm to choose given two specific arrays?
Awarded Dec 7 at 7:10
Why is IDA$^*$ faster than A$^*$? Why does IDA$^*$ visit more nodes than A$^*$?
Awarded Dec 6 at 12:40
Is dynamic programming restricted to optimization problems?
Awarded Dec 6 at 11:30
Grammar is LL(1) or not?
Awarded Dec 6 at 7:20
When is a bound asymptotically tight?
Awarded Dec 6 at 6:40
Using decision oracle to solve optimization problem of maximum polyomino tiling
Awarded Dec 6 at 5:10
When does a semaphore issue a wait and when does it issue a signal?
Awarded Dec 5 at 21:45
Splitting a node in B+ tree with odd number of keys
Awarded Dec 5 at 21:15
Some questions about the Computability of Turing Machines
Awarded Dec 5 at 17:55
Why do we need to take the derivative of the activation function in backwards propagation?
Awarded Dec 5 at 17:15
Removing vertices from a labelled graph
Awarded Dec 5 at 13:50
Hausdorff distance between two binary images according to distance maps
Awarded Dec 5 at 13:30
How to prove that Exact Cover is NP-complete using SAT?
Awarded Dec 5 at 4:00
Prove the equivalence of regular expressions
Awarded Dec 4 at 21:25
Largest number of unique values in sets
Awarded Dec 4 at 18:55
How to prove that $3$-Spanning-Tree decision problem is $NP$-Complete
Awarded Dec 4 at 17:50
Can every regular expression be written as sum of products?
Awarded Dec 4 at 12:10
Minimum XOR for queries
Awarded Dec 4 at 11:50
Grover's algorithm on probabilistic classical machines
Awarded Dec 4 at 1:20
Prove that $\text{EF p}$ can't be written in LTL
Awarded Dec 3 at 19:55
Sort array of duplicate integers in place
Awarded Dec 3 at 19:40
Assuming P != NP, what is the cardinality of the set of NP-Hard languages?
Awarded Dec 3 at 15:45
Run-Time environments
Awarded Dec 3 at 2:10
Is there a well-known algorithm for arranging inputs according to their category?
Awarded Dec 2 at 17:10
Predicting the outcome of sporting events with multiplicative scoring
Awarded Dec 2 at 6:50
Is the problem of deciding whether two programs have the same semantics decidable?
Awarded Dec 2 at 1:35
Can nfa consume more than one letter at a time
Awarded Dec 1 at 23:25
Paging - access less than a page of memory
Awarded Dec 1 at 22:30
How to simplify context free grammars?
Awarded Dec 1 at 21:15
Clarification about conclusion of $Θ(nlogn)$?
Awarded Dec 1 at 15:10
Kolmogorov Complexity, struggle with equation
Awarded Dec 1 at 12:25
(0+ 11*0) + (0 +11*0)(1 +01*0)* (1 +01*0) =1*0(1 +01*0)*
Awarded Dec 1 at 5:20
1 2 3 4 5 … 139