Skip to search formSkip to main contentSkip to account menu

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 (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
  • H. Gainer
  • 2011
  • Corpus ID: 7003188
No. 776, p. 504. Yajima, H., Kubo, K., Kinomura, Y., and Lande, S., 1966, Studies on peptides, XI. The effect on melanotropic… 
Highly Cited
2006
Highly Cited
2006
Wireless mesh network is designed as an economical solution for last-mile broadband Internet access. In this paper, we study… 
Highly Cited
2003
Highly Cited
2003
Nature Genet. 32, 650–654 (2002). Published online 11 November 2002; doi:10.1038/ng1047 A typographical error in the third… 
Highly Cited
2003
Highly Cited
2003
Highly Cited
2002
Highly Cited
2002
The critical aspects of the epitaxial growth of alkaline-earth oxides on silicon are described in detail. The step by step… 
Highly Cited
1998
Highly Cited
1998
Mesoporous silica fibers with accessible, highly ordered large periodic pores are directly drawn from a highly viscous surfactant… 
Highly Cited
1995
Highly Cited
1995
Artificial "neural networks" are widely used as flexible models for classification and regression applications, but questions… 
Highly Cited
1995
Highly Cited
1995
We show that for any radio network there exists a schedule of a broadcast whose time is O(D + 1og5(n)), where D is the diameter… 
Highly Cited
1987
Highly Cited
1987
Abstract The site structure beneath the five broadband stations of the Regional Seismic Test Network (RSTN) has been determined… 
Highly Cited
1959
Highly Cited
1959
s 60, 5747 (1956). (100) FRANKEL, S., AND ALLERS, R.: Biochem. Z. 18,40 (1909). (101) FRIEDENWALD, J. S., MICHEL, H., AND BUSCHKE…