Skip to search formSkip to main contentSkip to account menu

FP (complexity)

Known as: FP, FP (class), FP (complexity class) 
In computational complexity theory, the complexity class FP is the set of function problems which can be solved by a deterministic Turing machine in… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
This paper optimizes resource allocation that maximizes the energy efficiency (EE) of wireless systems with statistical quality… 
2011
2011
In recent years, graph representations have been used extensively for modelling complicated structural information, such as… 
2009
2009
Shoback D 1999 Expression and signal transduction of calciumsensing receptors in cartilage and bone. Endocrinology 140:58835893… 
2009
2009
We present calculations of the exchange interactions and Curie temperatures in Cr-based pnictides and chalcogenides of the form… 
2008
2008
Experimental measurements of the second order susceptibilities for the second harmonic generation are reported for YAl3(BO3)4… 
2006
Highly Cited
2003
Highly Cited
2003
A new method to acquire four-layer depth of interaction (DOI) information is proposed for the next generation positron emission… 
1999
1999
Population-based incremental learning (PBIL) is a recently developed evolutionary computing technique based on concepts found in… 
1990
1990
The device sensitivity to the offset length variations in the recently proposed field-plated (FP) polysilicon high-voltage thin… 
1988
1988
Presents a demand-driven evaluation system for list-structure language systems, using the functional language FP. It enables…