6 Proving special case of SAT is in P 2 Minimum cost circulation problem with bounded number of edges 2 Data structure with AVL and Hash table 2 $k$ vertex-disjoint paths cover in Directed Acyclic Graph 2 Given $k$ points in $n$-dimensions, such that $n\geq3$, is there a polytime algorithm for finding a curve that splits them into 2 sets of points?

### Reputation (310)

 +10 Size of order-preserving minimal perfect hash family +30 Choosing an independent hash function, given hash function value +10 Dijkstra Partitioning Algorithm : Special Case +10 Determine in which class $L=\big\{\langle M_1,M_2,w\rangle\mid M_1,M_2\text{ are TM and }L(M_1)\cap L(M_2)=\{w\}\big\}$

### Questions (6)

 5 Minimum cost circulation problem with bounded number of edges 3 Choosing an independent hash function, given hash function value 2 An approximation for the sum of k largest elements of n-sorted arrays? 1 Size of order-preserving minimal perfect hash family 1 Polynomial by the size of the output and the input

### Tags (28)

 16 algorithms × 11 3 algorithm-analysis × 2 8 polynomial-time × 2 2 classification 6 satisfiability 2 sorting 4 network-flow × 4 2 partitions 3 graphs × 2 1 np-complete × 3