StackOverflow Questions for Tag: np

user7821248

Reputation:

Make the assumption that P = NP

graph-theorynpnp-hardcomputability

Score: 2

Answers: 1

BoostMatch

Reputation: 15

What would P=NP tell us for a proof?

algorithmproofnp

Score: 0

Answers: 0

AziMez

Reputation: 2082

Efficient way to find if a Matrix is Sub-Matrix of another one?

pythonmatrixnp

Score: 2

Answers: 1

jgtrz

Reputation: 375

Ranking and Aggregating by dates on a group in pandas df

pythonpandaslambdaaggregate-functionsnp

Score: 0

Answers: 1

zvonimir

Reputation: 109

Circular graph common inner nodes, in NP

algorithmcomplexity-theorygraph-theorynp

Score: 3

Answers: 1

asmgx

Reputation: 8044

A problem similar to the travelling salesman problem

algorithmoptimizationtraveling-salesmannp

Score: 0

Answers: 0

feedback

Reputation: 3

Why in max-cut ( weigthted graph )we can't do an approximation lower than 1/2?

algorithmmathcomputer-sciencenpturing-machines

Score: 0

Answers: 0

user17327323

Reputation:

If np-complete problems are the hardest problems in np, why are there multiple np-complete problems?

Score: 0

Answers: 1

Gaurav

Reputation: 11

Find the class of the problem PP1 and PP2 using the information given below

algorithmnpnp-complete

Score: 1

Answers: 0

user3104352

Reputation: 1130

how to use np.diff with reference point in python

pythonpandasdiffnp

Score: 1

Answers: 1

Ahmed_A

Reputation: 87

Why NP problem can not be solved using deterministic Turing machine, however every NTM has TM

npturing-machines

Score: 0

Answers: 1

jarnald

Reputation: 41

Why is NP only a set of decision problems?

complexity-theorynp

Score: 3

Answers: 2

HamedKhan

Reputation: 71

Minimum number of groups with recursive grouping a set of objects with their properties

algorithmpartitioningnp

Score: 0

Answers: 0

user16634163

Reputation:

Error when checking input: expected conv2d_4_input to have shape (100, 100, 1) but got array with shape (100, 100, 3)

pythonarraysimagetensorflownp

Score: 0

Answers: 1

Jeahinator

Reputation: 77

Real Weights Knapsack in polynomialtime

runtimetime-complexityknapsack-problemnp

Score: 0

Answers: 2

Patrick

Reputation: 637

Algorithm Problem: Find the longest elementary cycle in a directed graph

algorithmgraphdepth-first-searchnp

Score: 0

Answers: 2

Shraddha

Reputation: 155

np.where on multiple variables

pythonpandasif-statementcase-whennp

Score: 1

Answers: 2

Vishal Jain

Reputation: 21

Disconnect two nodes in undirected weighted graph with min cost

algorithmgraph-theorynpmax-flow

Score: 2

Answers: 2

Fibonacci

Reputation: 5

What it means that we can verify solution of knapsack problem in polynomial time?

algorithmcomplexity-theoryknapsack-problemnp

Score: 1

Answers: 2

BREAKWAVE

Reputation: 43

How do I cover all the edges of a graph with the minimum amount of nodes?

javaalgorithmgraphgraph-algorithmnp

Score: 0

Answers: 2

PreviousPage 5Next

StackOverflow Questions for Tag: np

Make the assumption that P = NP

What would P=NP tell us for a proof?

Efficient way to find if a Matrix is Sub-Matrix of another one?

Ranking and Aggregating by dates on a group in pandas df

Circular graph common inner nodes, in NP

A problem similar to the travelling salesman problem

Why in max-cut ( weigthted graph )we can&#39;t do an approximation lower than 1/2?

If np-complete problems are the hardest problems in np, why are there multiple np-complete problems?

Find the class of the problem PP1 and PP2 using the information given below

how to use np.diff with reference point in python

Why NP problem can not be solved using deterministic Turing machine, however every NTM has TM

Why is NP only a set of decision problems?

Minimum number of groups with recursive grouping a set of objects with their properties

Error when checking input: expected conv2d_4_input to have shape (100, 100, 1) but got array with shape (100, 100, 3)

Real Weights Knapsack in polynomialtime

Algorithm Problem: Find the longest elementary cycle in a directed graph

np.where on multiple variables

Disconnect two nodes in undirected weighted graph with min cost

What it means that we can verify solution of knapsack problem in polynomial time?

How do I cover all the edges of a graph with the minimum amount of nodes?

Why in max-cut ( weigthted graph )we can't do an approximation lower than 1/2?