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.
Review
2017
Review
2017
There is now abundant evidence that the luminosity of the Galactic super-massive black hole (SMBH) has not always been as low as… 
Highly Cited
2016
Highly Cited
2016
Indoor positioning has become increasingly important in the past decade. Some approaches for the integration of micro-electro… 
2016
2016
A flux pump (FP) exciter injects dc current into the high-temperature superconducting (HTS) field coils of an HTS rotating… 
Highly Cited
2015
Highly Cited
2015
The force–displacement behavior of the Friction Pendulum™ (FP) bearing is a function of the coefficient of sliding friction… 
2011
2011
A two-bit all-optical digital comparator using single mode Fabry-Pérot laser diodes (SMFP-LDs) at an input data rate of 10 Gbps… 
Highly Cited
2009
Highly Cited
2009
Broadcasting is an essential and effective data propagation mechanism, with several of important applications such as route… 
Highly Cited
2008
Highly Cited
2008
Benchmarks provide an experimental basis for evaluating software engineering processes or techniques in an objective and… 
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
The automatic conversion of floating point software implementations of algorithms to a equivalent fixed point implementation…