## Udacity

Need Help?

Click a course below, then sort by "name, a-z"
To Translate, click a video & "start a new translation"
FAQ: http://goo.gl/yRzlI

### 共有する

プロジェクト：

Sort:
• one: ⏎ 1 言語⏎ other: ⏎ 1 言語⏎

#### 13-17 Closest To 2-SAT

• one: ⏎ 1 言語⏎ other: ⏎ 1 言語⏎

#### 13-16 Shortest Tour Solution

• one: ⏎ 1 言語⏎ other: ⏎ 1 言語⏎

#### 13-15 Shortest Tour

• one: ⏎ 1 言語⏎ other: ⏎ 1 言語⏎

#### 13-14 FPT Vertex Cover Clique Independent Set Shortest Tour

• one: ⏎ 1 言語⏎ other: ⏎ 1 言語⏎

#### 13-13 Fixed Parameter Tractability

• one: ⏎ 1 言語⏎ other: ⏎ 1 言語⏎

#### 13-12 Time To Solve Decision Version Solution

• one: ⏎ 1 言語⏎ other: ⏎ 1 言語⏎

#### 13-11 Time To Solve Decision Version

• one: ⏎ 1 言語⏎ other: ⏎ 1 言語⏎

#### 13-10 Search Tree Size

• one: ⏎ 1 言語⏎ other: ⏎ 1 言語⏎

#### 13-09 Number Of Assignments Solution

• one: ⏎ 1 言語⏎ other: ⏎ 1 言語⏎

#### 13-08 Number Of Assignments

• one: ⏎ 1 言語⏎ other: ⏎ 1 言語⏎

#### 13-07 Decision Version Of Vertex Cover Solution

• one: ⏎ 1 言語⏎ other: ⏎ 1 言語⏎

#### 13-06 Decision Version Of Vertex Cover

• one: ⏎ 1 言語⏎ other: ⏎ 1 言語⏎

#### 13-05 Measuring The Hardness Of Vertex Cover Solution

• one: ⏎ 1 言語⏎ other: ⏎ 1 言語⏎

#### 13-04 Measuring The Hardness Of Vertex Cover

• one: ⏎ 1 言語⏎ other: ⏎ 1 言語⏎

#### 13-03 Hardness

• one: ⏎ 1 言語⏎ other: ⏎ 1 言語⏎