P (complexity)

Known as: Nonuniform polynomial time, Complexity class P, P-hard 
In computational complexity theory, P, also known as PTIME or DTIME(nO(1)), is a fundamental complexity class. It contains all decision problems that… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1936-2017
020040060019362016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
It's not surprisingly when entering this site to get the book. One of the popular books now is the fundamentals of parameterized… (More)
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Type 1 diabetes (T1D) is a common autoimmune disorder that arises from the action of multiple genetic and environmental risk… (More)
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
Highly Cited
2004
Highly Cited
2004
The technique of k-anonymization has been proposed in the literature as an alternative way to release public information, while… (More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Preface This book should be of interest to anyone who would like to understand computation from the point of view of logic. The… (More)
  • figure 1.1
  • figure 1.11
  • table 1.19
  • figure 2.13
  • figure 2.21
Is this relevant?
Highly Cited
1998
Highly Cited
1998
We present new algorithms for reinforcement learning and prove that they have polynomial bounds on the resources required to… (More)
  • figure 1
Is this relevant?
Highly Cited
1995
Highly Cited
1995
ion. For example, when dealing with curves for interactive design, he works with them without regard to the number of control… (More)
  • figure 1.1
  • figure 1.2
  • figure 1.3
  • figure 1.4
  • figure 1.5
Is this relevant?
Highly Cited
1994
Highly Cited
1994
We define several new complexity classes of search problems, "between" the classes FP and FNP. These new classes are contained… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
-This article introduces a new neural network architecture, called A R T M A P , that autonomously learns to class(~v arbitrarily… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • figure 3
Is this relevant?
Highly Cited
1986
Highly Cited
1986
We take a complexity theoretic view of A. C. Yao's theory of communication complexity. A rich structure of natural complexity… (More)
Is this relevant?
Highly Cited
1982
Highly Cited
1982
Recursive analysis, the theory of computation of functions on real numbers, has been studied from various aspects. We investigate… (More)
  • figure 1
Is this relevant?