Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Abstract A first-principles approach is used to study the structural, electronic and magnetic properties of ZrCoTiZ(Z = Si, Ge… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2009
Highly Cited
2009
We describe a complete set of algorithms for ab initio molecular simulations based on numerically tabulated atom-centered… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Following on from the definition of a conceptual model and its requirements laid out in a previous paper, a framework for… Expand
Is this relevant?
Highly Cited
2008
Highly Cited
2008
We achieved a 0.5 Hz optical beat note linewidth with $\ensuremath{\sim}0.1\text{ }\text{Hz}/\text{s}$ frequency drift at 972 nm… Expand
Is this relevant?
Highly Cited
2006
Highly Cited
2006
This paper provides a norm-based explanation for two features of the fertility transition that have been observed in many… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
Highly Cited
2005
Highly Cited
2005
The total energies and equilibrium cohesive properties of 69 intermetallics in the Al–TM (TM = Ti, Zr and Hf) systems are… Expand
  • table 1
  • table 2
  • table 3
  • figure 1
  • table 4
Is this relevant?
1999
1999
The automatic conversion of floating point software implementations of algorithms to a equivalent fixed point implementation… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1991
Highly Cited
1991
In this paper we prove a Sobolev-Poincare inequality for a class of function spaces associated with some degenerate elliptic… Expand
Is this relevant?
Highly Cited
1956
Highly Cited
1956
Let X be a random variable which for simplicity we shall assume to have discrete values x and which has a probability… Expand
Is this relevant?