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.
2018
2018
Computer vision based fine-grained recognition has received great attention in recent years. Existing works focus on… 
2015
2015
El manejo anestesico se engloba en tres fases: induccion, mantenimiento y emersion. Los farmacos intravenosos en la induccion… 
2013
2013
The structural and electronic properties of new structural cubic (GaN)$_1$/(ZnO)$_1$ superlattice have been investigated using… 
2012
2012
We present time domain modeling of a weak aperiodic distributed feedback (ADFB) grating incorporated into a Fabry-Pérot (FP… 
2011
2011
29 mars 2011 - Bureau National de l'UNSA Fonction publique Lors de son bureau national, l'UNSA Fonction Publique a decide a l… 
2011
2011
All-optical signal processing has attracted significant interest in recent years due to its higher data rates, reduced… 
2010
2010
In case of a severe accident on a nuclear reactor, radioactive iodine may be released into the environment, impacting… 
2009
2009
This work was supported by the Korean Science and engineering Foundation (KOSEF) grant funded by the Korean Government (MEST).