Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2003
Highly Cited
2003
We consider the problem of maximizing the lifetime of a given multicast connection in a wireless network of energy-constrained (e… 
Highly Cited
2001
Highly Cited
2001
The block ciphers MISTY1 and MISTY2 proposed by Matsui are based on the principle of provable security against differential and… 
Highly Cited
1999
Highly Cited
1999
Information about the ecological components of Alaska's Prince William Sound (PWS) has increased considerably since the 1989… 
Highly Cited
1995
Highly Cited
1995
Observations of both Ethernet traffic and variable bit rate (VBR) video traffic have demonstrated that these traffics exhibit… 
Highly Cited
1995
Highly Cited
1995
The concept of Open GIS depends on precise definitions of data, operations and interfaces. This paper argues for the use of… 
Highly Cited
1991
Highly Cited
1991
bending hot bands associated with the v4 fundamental. This constitutes the first characterization of the bending potential of C… 
Review
1985
Review
1985
The PLM is a co-processor a r c h i t e c t u r e designed for efficient execu t ion of Prolog programs. It is the first p ro to… 
Highly Cited
1983
Highly Cited
1983
ACE, a system for Automated Cable Expertise, is a Knowledge-Based Expert System designed to provide troubleshooting reports and… 
Review
1981
Review
1981
In 10 years of operation, GLORIA has been used on 26 cruises and has inonified more than 1% of the ocean floor. The paper reviews… 
Highly Cited
1960
Highly Cited
1960
The oxygen electrode does not behave reversibly in LiC1-KC1 at temperatures of 400~176 and at oxide ion concentrat ions of 0.1-0…