Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2018
Review
2018
The increasingly rapid creation, sharing and exchange of information nowadays put researchers and data scientists ahead of a… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
Highly Cited
2011
Highly Cited
2011
We give new evidence that quantum computers -- moreover, rudimentary quantum computers built entirely out of linear-optical… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Author(s): Asanovic, K; Bodik, R; Catanzaro, B; Gebis, J; Husbands, P; Keutzer, K; Patterson, D; Plishker, W; Shalf, J; Williams… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
  • N. Immerman
  • Graduate Texts in Computer Science
  • 1999
  • Corpus ID: 6916124
Preface This book should be of interest to anyone who would like to understand computation from the point of view of logic. The… Expand
  • figure 1.1
  • figure 1.11
  • table 1.19
  • figure 2.13
  • figure 2.21
Is this relevant?
Highly Cited
1997
Highly Cited
1997
The book covers all aspects of non-uniform rational B-splines necessary to design geometry in a computer-aided environment. Basic… Expand
  • figure 1.1
  • figure 1.2
  • figure 1.3
  • figure 1.4
  • figure 1.5
Is this relevant?
Highly Cited
1995
Highly Cited
1995
From the Publisher: Artificial "neural networks" are now widely used as flexible models for regression classification… Expand
Is this relevant?
Highly Cited
1994
Highly Cited
1994
This paper will focus on the semantic representation of verbs in computer systems and its impact on lexical selection problems in… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1990
Highly Cited
1990
Using grounded theory as an example, this paper examines three methodological questions that are generally applicable to all… Expand
Is this relevant?
Highly Cited
1971
Highly Cited
1971
It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to… Expand
Is this relevant?
Highly Cited
1960
Highly Cited
1960
CONSIDER Table 1. It represents in its formal characteristics a situation which arises in the clinical-social-personality areas… Expand
Is this relevant?