with our free apps for iPhone, iPad and Android

Get Started

Already have an account?

Log In

Algorithmic Problems
by Terry Tam
# Algorithmic Problems

## Traveling Salesman Problem (TSP)

## Hamilton Cycle

## 2-SAT

## Matrix Inversion

## Matrix Multiplication

## Convex Hull

## Sorting

## Subset Sum

## 3-Partition

## n-Vertex Coloring

## 3-SAT

## P

## NP-hard

## NP

## NP-complete

## Independent Set

## Vertex Cover

## Clique

## Decision Problem

## Optimization Problem

## Knapsack

0.0 stars - reviews
range from 0 to 5

Partition

Strongly NP-complete

Weakly NP-complete

n-Independent Set

Max-Independent Set

n-Vertex Cover

Min-Vertex Cover

Min-Vertex Cover (bipartite graph)

n-Clique

Max-Clique

0-1 Knapsack

Fractional Knapsack