Computer Science
Fraïssé's user avatar
Fraïssé's user avatar
Fraïssé's user avatar
Fraïssé
  • Member for 9 years, 4 months
  • Last seen more than a week ago
  • Ichibankan, 5 Chome-3-12 Ginza, Chuo City, Tokyo, Japan
Profile Activity
Stats
791
reputation
41k
reached
0
answers
23
questions
Communities
About

世の中を　憂しとやさしと　おもへども　飛び立ちかねつ　鳥にしあらねば

Badges
View all badges
This user doesn’t have any gold badges yet.
10
silver badges
19
bronze badges
Top tags
View all tags
0
Score
8
Posts
35
Posts %
0
Score
3
Posts
13
Posts %
0
Score
3
Posts
13
Posts %
0
Score
2
Posts
9
Posts %
0
Score
2
Posts
9
Posts %
0
Score
2
Posts
9
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
question
27
Is there a physical analogy to the Turing Machine?
Dec 3, 2014
question
7
How can I make sense of amortized accounting method?
Nov 9, 2014
question
4
Is there a flaw in this Wikipedia proof of cycle property of Minimum Spanning Tree?
Dec 17, 2014
question
4
What does it mean for a problem to be both NP hard and coNP hard
Dec 2, 2015
question
4
Reference Request: Overlaps between complexity theory and dynamical systems?
Feb 29, 2016
question
3
How to apply "verification" and "decision" for the SUBSET SUM problem?
Dec 3, 2014
question
3
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"
Dec 3, 2014
question
3
Can someone explain in a simple way what "reducible" mean in complexity theory? [duplicate]
Dec 3, 2014
question
2
Can a language recognized by a NFA be recognized by a push down or Turing machine?
Dec 15, 2014
question
1
How do deal with the following situations using Prim's algorithm?
Nov 9, 2014

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.