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

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
2008
Highly Cited
2008
This paper studies the role of fluctuations in the aggregate consumption-wealth ratio for predicting stock returns. Using U.S… (More)
  • figure 1
  • table IV
  • table V
  • table VI
  • table VII
Is this relevant?
Highly Cited
2006
Highly Cited
2006
  • Chang - Tai Hsieh Peter J. Klenow
  • 2006
Resource misallocation can lower aggregate total factor productivity (TFP). We use micro data on manufacturing establishments to… (More)
  • table 2
  • table 7
  • table 10
  • table 11
  • table 14
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
2001
Highly Cited
2001
The design of the IP protocol makes it difficult to reliably identify the originator of an IP packet. Even in the absence of any… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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
This paper employs response surface regressions based on simulation experiments to calculate asymptotic distribution functions… (More)
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
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?
Highly Cited
1970
Highly Cited
1970
This paper first proves the Savitch Theorem: any nondeterminstic L(n)− tape bounded Turing Machine can be simulated by a… (More)
Is this relevant?