Python time from a 6 digit number...

Find a maximum tree subgraph with given number of edges that is a subgraph of a tree...

Using NP Reductions...

Is the variation of Knapsack NP-Complete?...

NP-Complete Graph optimization: minimal node selection?...

Prove that the problem of factoring α is in NP...

Double exponential problems?...

Is it necessary for NP problems to be decision problems ?...

NP hard but not NPC...

When NP complete becomes NP hard...

Expression from an array of numbers...

How do you determine if a language falls into NP?...

Complexity of an old Top Coder riddle: Making a number by inserting +...

Is the 0-1 Knapsack that each item has the same weight NP-complete?...

reducing to np hard...

Np-hardness reduction...

NP verifier-based definition...

Vertex packing on a bipartite graph...

Unit Testing Approximation Algorithms...

Is this an NP problem?...

Are there decision problems which are decidable but not in NP?...

Which of the following is the most precise classification of a problem X?...