answersLogoWhite

0


Best Answer

=[]'

User Avatar

Wiki User

10y ago
This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: What does NP means in Microsoft word 2003?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

What is np?

np simply means no problem


What does np mean in texting?

"No Problem"Np means No problem.


What does 925 and NP MARK means it is on a bracelet thank you?

NP 925


What does np or ns stand for in classifieds?

I believe NS means non-smoker, and NP means no pets.


What do the letters Dip LP NP mean?

Dip LP means Diploma in Legal Practice, while NP means Notary Public.


What is np on Twitter?

Typically I believe it means, 'No problem.'


What does NP LA mean?

hm it means no problem


What does the medical abbreviation NP mean?

NP most commonly means nurse practitioner. It may also mean neuropsychiatric.


What do the grades NP P SP stand for at Mount San Antonio college?

np means no pass, p means pass and i don't know what sp stand for.


Which element is Np?

Np is the elemental symbol for Neptunium.NPO means Non per os or "nothing to be taken orally". This is a common pre-op direction.Shorthand on the internet, np stands for no problem


What is another word for swear?

curse , np dude


What is the difference between NP and NP Complete problems?

- a problem in NP means that it can be solved in polynomial time with a non-deterministic turing machine - a problem that is NP-hard means that all problems in NP are "easier" than this problem - a problem that is NP-complete means that it is in NP and it is NP-hard example - Hamiltonian path in a graph: The problem is: given a graph as input, an algorithm must say whether there is a hamiltonian path in it or not. in NP: here is an algorithm that works in polynomial time on a non-deterministic turing machine: guess a path in the graph. Check that it is really a hamiltonian path. NP-hard: we use reduction from a problem that is NP-comlete (SAT for example). Given an input for the other problem we construct a graph for the hamiltonian-path problem. The graph should have a path iff the original problem should return "true". Therefore, if there is an algorithm that executes in polynomial time, we solve all the problems in NP in polynomial time.j