FO (complexity)

Known as: FO(LFP), FO(PFP) 
In descriptive complexity, a branch of computational complexity, FO is a complexity class of structures which can be recognized by formulas of first… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2017
Review
2017
Cloud Computing and Distributed Systems (CLOUDS) Laboratory, Department of Computing and Information Systems, The University of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 6
  • figure 5
Is this relevant?
Highly Cited
2010
Highly Cited
2010
A Hilbert space embedding for probability measures has recently been proposed, with applications including dimensionality… (More)
  • table 1
  • table 2
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2009
Highly Cited
2009
I insider misuse of information systems resources (i.e., IS misuse) represents a significant threat to organizations. For example… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Forward (direct) osmosis (FO) using semi-permeable polymeric membranes may be a viable alternative to reverse osmosis as a lower… (More)
  • figure 2
  • figure 2
  • figure 3
  • table 1
  • table 1
Is this relevant?
Highly Cited
2002
Highly Cited
2002
This paper describes the initial work toward the production of monthly global (land and ocean) analyses of precipitation for an… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Imaging of chlorophyll a fluorescence from leaves has enabled the spatial resolution of the fluorescence parameter, ΔF/Fm… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, NP, and… (More)
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Amnesic patients and control subjects participated in a study of probabilistic classification learning. In each of three tasks… (More)
  • table 1
  • table 2
  • figure 1
  • table 3
  • figure 2
Is this relevant?
Highly Cited
1993
Highly Cited
1993
where fk is the current approximation, and Rk f the current residual (error). Using initial values of Ro f = f , fo = 0, and k… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1974
Highly Cited
1974
The inherent computational complexity of a va r i e ty of decision problems i n mathematical logic and the theory of automata i s… (More)
  • table 4.2
Is this relevant?