M a m a D
  • Member for 8 years
  • Last seen more than a month ago
  • Iran
3 answers
16 votes
5k views
7 bookmarks
Why not to take the unary representation of numbers in numeric algorithms?
2 answers
16 votes
11k views
8 bookmarks
PTAS definition vs. FPTAS
1 answers
7 votes
795 views
1 bookmarks
Does Church-Turing thesis also apply to artificial intelligence?
2 answers
7 votes
5k views
5 bookmarks
Why is Oracle Turing Machine important?
1 answers
6 votes
5k views
2 bookmarks
What is a partially computable function?
1 answers
5 votes
361 views
An algorithm for a minimization problem, How to minimize the wasted length of combination of multiple items with different length and number
1 answers
4 votes
3k views
Why is Minimum $k$-cut NP hard when $k$ is specified as part of the input?
2 answers
3 votes
4k views
The recursive solution to the all-pairs shortest-paths of Floyd-Warshall algorithm
2 answers
3 votes
342 views
Primitive recursive functions and unbounded quantifiers
1 answers
3 votes
926 views
What is the exact meaning of a Predicate, decidability and computability?
1 answers
2 votes
9k views
How to solve recurrence T(n) = 2T(n/2) + n/log(n) using substitution method
0 answers
2 votes
252 views
1 bookmarks
Why Johnson’s algorithm for all pairs shortest paths may create negative cycle?
3 answers
2 votes
2k views
1 bookmarks
Why is it meaningless to say the runtime of an algorithm is at least in the order of n squared?
3 answers
2 votes
427 views
Does the normal form theorem imply that every partially computabe function is primitive recursive?
1 answers
2 votes
68 views
Solution to a Np-hard problem and its relevance to a dual LP
1 answers
2 votes
1k views
1 bookmarks
(a,b)-tree vs B-tree
1 answers
2 votes
606 views
Converting maximization to minimization in aproximation algorithms
2 answers
2 votes
378 views
Is it possible to obtain a total function by composition of partial functions?
1 answers
1 votes
167 views
Proving undecidability of HALT_tm by reduction
2 answers
1 votes
202 views
1 bookmarks
Why is $\dfrac{1}{2}n^2-3n = \Theta(n^2)$?
1 answers
1 votes
120 views
Problem with the mapping reduction from $A_{TM}$ to $HALT_{TM}$
1 answers
1 votes
126 views
Generate a unique number for a set of sequences of letters
1 answers
1 votes
106 views
1 bookmarks
Why every point is in exactly one pair in Well Separated Pair Decomposition(WSPD)
2 answers
1 votes
1k views
Why half of the medians are greater than the median of medians?
0 answers
1 votes
722 views
Why do we count the ceils and floors in recursive functions?
1 answers
1 votes
545 views
1 bookmarks
Problem with understanding the lower bound of OPT in Greedy Set Cover approximation algorithm
0 answers
1 votes
57 views
Solving a recurrence relation
1 answers
1 votes
130 views
Is Universality Theorem applicable to Halting problem?
2 answers
1 votes
223 views
If $B$, $\overline{B}\neq \varnothing$ , then for every recursive set $A$, $A \leq_m B$
2 answers
1 votes
89 views
Is it true, If $A$ is turing recognizable and $A \leq_m\bar{A}$ then $A$ is recursive?