Complexity theory
attempts to define such differences through a formal criterion for what is
meant by a mathematical problem feasibly be decidable , that is to say that this can be resolved by a
conventional Turing machine with a number measures which are proportional to a
polynomial function of the size of input. The category of problem with this
property is known as P ( polynomial)  and among the first three of the
abovedescribed problems. P can be shown formally distinguished from several
other classes, such as to be EXP ( exponential time).Third problem which is
fitted from above. The second problem of the above is included in a complex
class known as NP ( nondeterministic polynomial)  consists of problems that
can certainly by a computation of a nondeterministic Turing machine in a
number of steps that a polynomial function, determines the size of the input.
Pages
Popular Posts

Factors influencing on curriculum developmentSeveral factors affect all curriculum development in meeting the needs of 21st century learners in both organized academic settings and c...

Advantages and disadvantages of discovery learningAdvantages The discovery learning literature often claims the following advantages: Supports active engagement of the learner in ...

Causes of Social Stratification:There are five basic points which gives clear idea about the causes of social stratification; (1) Inequality – Inequality exists beca...

FACTORS CONSIDERED IN CURRICULUM DEVELOPMENTThe following factors are considered in developing the curriculum: u The TeachingLearning Process u Environment School Community ...

Advantages of Word Processing1. Word processing software produces errorfree documents. Word processing software like MS Word marks out errors by underlining the word...

Barriers to HRP(Human Resource Planning)Human Resource Planners face significant barriers while formulating an HRP. The major barriers are elaborated below: 1) HR practiti...

Approaches of comparative educationApollo (1986) identified eight approaches to the study of Comparative Education. They are: 1. Problem Approach or Thematic approach ...

Types of social processSocial process can manifest itself in many ways. There are basically five types of social processes. They are competitive, conflict, coo...

Requisites for Successful HRP (Human Resource Planning)1. HRP must be recognized as an integral part of corporate planning 2. Support of top management is essential 3. There should be some...

Characteristics of good teaching aids:Teaching aids should be Ã˜ Meaningful and purposeful Ã˜ Motivates the learners Ã˜ Accurate in every aspect Ã˜ S...
The classes P and NP
P
and NP are two different complexity classes defined in two different Turing
Machine.
Pclass
is an algorithm is a member of the Ptype as required to obtain a polynomial
time to get an output, deterministically. NP –Class is an algorithm is a member
of NP. This class takes polynomial time to verify output,
nondeterministically. A Turing machine can be used synonymous with an
algorithm
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment