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… (More)
Wikipedia

Related topics

Related topics

18 relations
Boolean satisfiability problemClique problemComplexity classComputational complexity theory
(More)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Evaluating the degree of oxygenation of organic aerosol during foggy and hazy days in Hong Kong using high-resolution time-of-flight aerosol mass spectrometry (HR-ToF-AMS)
The chemical characteristics of organic aerosol (OA) are still poorly constrained. Here we present observation results of the… (More)
Is this relevant?
2011
2011
Realization of All-Optical Digital Comparator Using Single Mode Fabry–Pérot Laser Diodes
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… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Ab initio molecular simulations with numeric atom-centered orbitals
a r t i c l e i n f o a b s t r a c t Keywords: Ab initio molecular simulations Density-functional theory Atom-centered basis… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
2009
2009
WEIGHTED SOBOLEV-POINCARÉ INEQUALITIES AND POINTWISE ESTIMATES FOR A CLASS OF DEGENERATE ELLIPTIC EQUATIONS
In this paper we prove a Sobolev-Poincaré inequality for a class of function spaces associated with some degenerate elliptic… (More)
Is this relevant?
Highly Cited
2008
Highly Cited
2008
On establishing a benchmark for evaluating static analysis alert prioritization and classification techniques
Benchmarks provide an experimental basis for evaluating software engineering processes or techniques in an objective and… (More)
  • figure 1
  • table 1
  • figure 2
  • table 2
  • table 4
Is this relevant?
2007
2007
On the Complexity of Sphere Decoding for Differential Detection
Multiple-symbol differential detection (MSDD) for multiple-input-multiple-output Rayleigh-fading channels is considered. MSDD… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Social norms and the fertility transition
This paper provides a norm-based explanation for two features of the fertility transition that have been observed in many… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
2003
2003
Performance of 256ch flat panel PS-PMT with small crystals for a DOI PET detector
A 256 channel flat panel position sensitive photomultiplier tube (256ch FP-PMT) was evaluated for application to a depth of… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • table I
Is this relevant?
1999
1999
Solving the multiobjective possibilistic linear programming problem
In conventional multiobjective decision making problems, the estimation of the parameters of the model is often a problematic… (More)
  • table 1
  • table 2
  • figure 1
Is this relevant?
Highly Cited
1956
Highly Cited
1956
An Empirical Bayes Approach to Statistics
  • Herbert Robbins
  • 1956
Let X be a random variable which for simplicity we shall assume to have discrete values x and which has a probability… (More)
Is this relevant?