Fraïssé
  • Member for 7 years, 4 months
  • Last seen more than a week ago
  • Ichibankan, 5 Chome-3-12 Ginza, Chuo City, Tokyo, Japan
3 answers
4 votes
5k views
3 bookmarks
What does it mean for a problem to be both NP hard and coNP hard
7 answers
27 votes
5k views
6 bookmarks
Is there a physical analogy to the Turing Machine?
1 answers
4 votes
4k views
Is there a flaw in this Wikipedia proof of cycle property of Minimum Spanning Tree?
1 answers
7 votes
4k views
3 bookmarks
How can I make sense of amortized accounting method?
2 answers
1 votes
2k views
If algorithm runs $\theta(n)$ in time T, doubling input size has what effect on time T?
1 answers
1 votes
2k views
How do deal with the following situations using Prim's algorithm?
3 answers
-1 votes
2k views
Does there exist $O(n)$ worst case sorting algorithm for sorting a list of integers?
1 answers
0 votes
1k views
Hadoop MapReduce Word Counting Example
1 answers
1 votes
1k views
Given a Red-Black Tree of n keys, is there a way to quickly determine if a red-node exists?
1 answers
0 votes
1k views
If NP is the class of problems that cannot be solved in polynomial time, what is co-NP?
1 answers
3 votes
752 views
How to apply "verification" and "decision" for the SUBSET SUM problem?
1 answers
0 votes
668 views
Why can no task have a utilization rate greater than one?
1 answers
-2 votes
614 views
How do I interpret a binary tree generated using Huffman coding algorithm?
1 answers
0 votes
535 views
Can someone provide an introductory example of a certificate in complexity theory?
1 answers
0 votes
523 views
Please explain linear programming as seen for this load balancing problem
1 answers
1 votes
454 views
How does "language" relate to "problem" in complexity theory?
1 answers
0 votes
337 views
Single Source Shortest Path: What does the weights on the vertex and edges tell you?
1 answers
0 votes
288 views
1 bookmarks
Unclear about proof for unique MST given graph G with distinct weights
1 answers
3 votes
284 views
What is the implication of the sentence: "if any NP complete problem is p time solvable, then all problems in NP are p time solvable"
1 answers
3 votes
237 views
Can someone explain in a simple way what "reducible" mean in complexity theory?
1 answers
2 votes
193 views
Can a language recognized by a NFA be recognized by a push down or Turing machine?
2 answers
0 votes
80 views
In general, does $f(g)$ and $f(h)$ have the same time complexity?
1 answers
4 votes
48 views
Reference Request: Overlaps between complexity theory and dynamical systems?