StackOverflow Questions for Tag: np

templatetypedef

Reputation: 373082

I need to solve an NP-hard problem. Is there hope?

performancetime-complexitynp

Score: 40

Answers: 1

Newbie

Reputation: 15

I am unable to use np.concatenate

pythondata-sciencelinear-regressionnp

Score: -1

Answers: 1

Mohsen Liaghat

Reputation: 49

proof of SAT np completeness

npcomputationnp-completesatnp-hard

Score: -1

Answers: 1

RedGlow

Reputation: 773

Minimizing colors: a variation of the knapsack algorithm?

algorithmknapsack-problemapproximationnp

Score: 4

Answers: 1

prgtttt

Reputation: 1

Add (1,2) shape of array to (1, 10, 2) shape of array. result (1, 11, 2)

pythonarraysappendreshapenp

Score: 0

Answers: 1

echo

Reputation: 135

Having trouble understanding the MAX-CUT problem

algorithmnpnp-hard

Score: 2

Answers: 2

kerl_japan

Reputation: 21

How do we, or can we, show many-one reduction of 3-SAT to a decision problem X when X takes an input that itself is exponentially long?

algorithmcomplexity-theorynpnp-hard

Score: 2

Answers: 0

HoneyWeGOTissues

Reputation: 71

Filling index list with correct values

pythonarraysindexingnp

Score: -1

Answers: 1

Lsy

Reputation: 21

Judge:Some N P -complete problems have polynomial time algorithms, but some others do not

algorithmnpnp-complete

Score: 1

Answers: 0

Rohit Pandey

Reputation: 2681

Why is the NP-complete set restricted to only decision problems?

complexity-theorynp

Score: 0

Answers: 1

user15319338

Reputation: 25

P vs. NP and Shor's Algorithm

npquantum-computing

Score: 1

Answers: 1

Alessio

Reputation: 35

How do I translate Decode(Packet) function in C++?

pythonc++packetnp

Score: 1

Answers: 1

ebhh

Reputation: 1

np.argsort not sorting correctly when value over a certain threshold

pythonnumpynpnp.argsort

Score: -1

Answers: 2

Anram

Reputation: 11

Are these two definitions of an NP-Complete problem equivalent?

algorithmnpnp-complete

Score: 1

Answers: 1

Martian_mars

Reputation: 1

How do you show that a language is in the class P, or Unknown?

algorithmtime-complexitycomplexity-theoryturing-machinesnp

Score: 0

Answers: 0

Steven-Carrot

Reputation: 3101

What problem type the Power Set belong to?

knapsack-problemnpnp-completenp-hardhalting-problem

Score: 0

Answers: 0

SMS

Reputation: 382

Extracting Bank Data for given sheet in python pandas using schwifty library

pandasconditional-formattingnp

Score: 0

Answers: 2

marc

Reputation: 101

polynomial time reduction from a problem to a NP-complete problem

complexity-theorynp

Score: -1

Answers: 1

Matt

Reputation: 785

Confusion about NP-hard and NP-Complete in Traveling Salesman problems

time-complexitycomplexity-theorycomputation-theorynpnon-deterministic

Score: 19

Answers: 2

templatetypedef

Reputation: 373082

What is fixed-parameter tractability? Why is it useful?

algorithmbig-otime-complexitynp

Score: 29

Answers: 2

PreviousPage 3Next

StackOverflow Questions for Tag: np

I need to solve an NP-hard problem. Is there hope?

I am unable to use np.concatenate

proof of SAT np completeness

Minimizing colors: a variation of the knapsack algorithm?

Add (1,2) shape of array to (1, 10, 2) shape of array. result (1, 11, 2)

Having trouble understanding the MAX-CUT problem

How do we, or can we, show many-one reduction of 3-SAT to a decision problem X when X takes an input that itself is exponentially long?

Filling index list with correct values

Judge:Some N P -complete problems have polynomial time algorithms, but some others do not

Why is the NP-complete set restricted to only decision problems?

P vs. NP and Shor&#39;s Algorithm

How do I translate Decode(Packet) function in C++?

np.argsort not sorting correctly when value over a certain threshold

Are these two definitions of an NP-Complete problem equivalent?

How do you show that a language is in the class P, or Unknown?

What problem type the Power Set belong to?

Extracting Bank Data for given sheet in python pandas using schwifty library

polynomial time reduction from a problem to a NP-complete problem

Confusion about NP-hard and NP-Complete in Traveling Salesman problems

What is fixed-parameter tractability? Why is it useful?

P vs. NP and Shor's Algorithm