Skip to search formSkip to main contentSkip to account menu
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… 
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
We give new evidence that quantum computers -- moreover, rudimentary quantum computers built entirely out of linear-optical… 
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Highly Cited
2001
Highly Cited
2001
Wireless ad-hoc sensor networks have recently emerged as a premier research topic. They have great long-term economic potential… 
  • figure 1
  • figure 2
  • figure 5
  • figure 3
  • figure 6
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… 
  • figure 1.1
  • figure 1.11
  • table 1.19
  • figure 2.13
  • figure 2.21
Highly Cited
1997
Highly Cited
1997
One Curve and Surface Basics.- 1.1 Implicit and Parametric Forms.- 1.2 Power Basis Form of a Curve.- 1.3 Bezier Curves.- 1.4… 
  • figure 1.1
  • figure 1.2
  • figure 1.3
  • figure 1.4
  • figure 1.5
Highly Cited
1995
Highly Cited
1995
Artificial "neural networks" are widely used as flexible models for classification and regression applications, but questions… 
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… 
  • figure 1
  • figure 2
  • figure 3
Highly Cited
1990
Highly Cited
1990
Using grounded theory as an example, this paper examines three methodological questions that are generally applicable to all… 
Highly Cited
1978
Highly Cited
1978
1 Includes drainage basin of Red River of the North, not a part of any accession, but in the past sometimes considered a part of… 
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… 
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…