User Fraïssé - Computer Science Stack Exchange

Fraïssé

Member for 9 years, 8 months
Last seen more than a month ago

Ichibankan, 5 Chome-3-12 Ginza, Chuo City, Tokyo, Japan

Meta user

24 Questions

Score Activity Newest Views

27 votes

7 answers

6k views

Is there a physical analogy to the Turing Machine?

asked Dec 3, 2014 at 4:58

7 votes

1 answer

5k views

How can I make sense of amortized accounting method?

asked Nov 9, 2014 at 2:57

5 votes

1 answer

5k views

Is there a flaw in this Wikipedia proof of cycle property of Minimum Spanning Tree?

asked Dec 17, 2014 at 6:49

5 votes

3 answers

7k views

What does it mean for a problem to be both NP hard and coNP hard

asked Dec 2, 2015 at 4:49

4 votes

1 answer

57 views

Reference Request: Overlaps between complexity theory and dynamical systems?

asked Feb 29, 2016 at 2:41

3 votes

1 answer

855 views

How to apply "verification" and "decision" for the SUBSET SUM problem?

asked Dec 3, 2014 at 2:08

3 votes

1 answer

292 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"

asked Dec 3, 2014 at 2:29

3 votes

1 answer

449 views

Can someone explain in a simple way what "reducible" mean in complexity theory? [duplicate]

asked Dec 3, 2014 at 4:11

2 votes

1 answer

433 views

Can a language recognized by a NFA be recognized by a push down or Turing machine?

asked Dec 15, 2014 at 3:22

1 vote

2 answers

4k views

If algorithm runs $\theta(n)$ in time T, doubling input size has what effect on time T?

asked Dec 16, 2014 at 17:53

1 vote

1 answer

1k views

Given a Red-Black Tree of n keys, is there a way to quickly determine if a red-node exists?

asked Dec 16, 2014 at 18:07

1 vote

1 answer

2k views

How do deal with the following situations using Prim's algorithm?

asked Nov 9, 2014 at 1:24

1 vote

1 answer

762 views

How does "language" relate to "problem" in complexity theory? [duplicate]

asked Dec 3, 2014 at 3:18

1 vote

1 answer

33 views

Seeking a reference for NP-hardness of optimization problems

asked Jan 3 at 16:08

0 votes

1 answer

2k views

If NP is the class of problems that cannot be solved in polynomial time, what is co-NP?

asked Nov 12, 2016 at 23:38

0 votes

1 answer

520 views

Single Source Shortest Path: What does the weights on the vertex and edges tell you?

asked Nov 23, 2014 at 23:10

0 votes

1 answer

1k views

Hadoop MapReduce Word Counting Example [closed]

asked Nov 24, 2014 at 19:42

0 votes

1 answer

306 views

Unclear about proof for unique MST given graph G with distinct weights

asked Dec 16, 2014 at 21:10

0 votes

1 answer

736 views

Why can no task have a utilization rate greater than one?

asked Mar 23, 2015 at 6:17

0 votes

1 answer

604 views

Please explain linear programming as seen for this load balancing problem

asked Aug 17, 2015 at 5:47

0 votes

2 answers

106 views

In general, does $f(g)$ and $f(h)$ have the same time complexity?

asked Dec 15, 2014 at 4:37

0 votes

1 answer

967 views

Can someone provide an introductory example of a certificate in complexity theory? [duplicate]

asked Dec 3, 2014 at 7:38

-1 votes

3 answers

2k views

Does there exist $O(n)$ worst case sorting algorithm for sorting a list of integers?

asked Dec 12, 2014 at 21:09

-2 votes

1 answer

711 views

How do I interpret a binary tree generated using Huffman coding algorithm?

asked Nov 27, 2014 at 12:55