Episode #125 of the Stack Overflow podcast is here. We talk Tilde Club and mechanical keyboards. Listen now
Computer Science
Meta user
Network profile
122
reputation
7

SapereAude

Apparently, this user prefers to keep an air of mystery about them.

1
answer
5
questions
~573
people reached
  • Member for 6 months
  • 14 profile views
  • Last seen Jun 3 at 11:34

Communities (11)

Top network posts

Top tags (11)

Score 5
Posts 5
Posts % 83
Score 5
Posts 3
Score 5
Posts 2
Score 5
Posts 2
Score 0
Posts 3
Score 0
Posts 3
View all tags →

Top posts (6) All Questions Answers | Votes Newest

7 Is a “local” version of 3-SAT NP-hard? May 15
5 How do we prove the time complexity of this simple problem in probabilistic inference on a Bayesian network? Apr 9
2 Is a “stacked”, “local” version of 3-SAT NP-hard? May 19
2 How do we prove the time complexity of this simple problem in probabilistic inference on a Bayesian network? Apr 8
2 Time complexity of a problem in probabilistic inference on a Bayesian network Apr 16
0 Is retrospective inference NP-hard? May 19

Badges (7)

Gold

—

Silver

—

Bronze

7

Rarest