Skip to search formSkip to main contentSkip to account menu

FNP (complexity)

Known as: FNP 
In computational complexity theory, the complexity class FNP is the function problem extension of the decision problem class NP. The name is somewhat… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2017
Highly Cited
2017
Modern data-driven systems often require classifiers capable of dealing with streaming imbalanced data and concept changes. The… 
2016
2016
Limited preemptive (LP) scheduling has been demonstrated to effectively improve the schedulability of fully preemptive (FP) and… 
Review
2015
Review
2015
We have analyzed the double-lined eclipsing binary system ASAS J180057-2333.8 from the All Sky Automated Survey (ASAS) catalogue… 
Review
2011
Review
2011
Virtual screening (VS) overcomes the limitations of traditional high-throughput screening (HTS) by applying computer-based… 
Highly Cited
2009
Highly Cited
2009
Network coding offers increased throughput and improved robustness to random faults in completely decentralized networks. In… 
Highly Cited
2009
Highly Cited
2009
Querying databases with preferences is an important research problem. Among various approaches to querying with preferences, the… 
Highly Cited
2002
Highly Cited
2002
This paper describes a new, advanced and completely revamped version of Mitkov's knowledge-poor approach to pronoun resolution… 
2001
2001
Let G be a finite‐dimensional semisimple Lie algebra over the complex numbers. Let A be the finite‐dimensional algebra of a… 
1996
1996
INTRODUCTION Fifty-eight million Americans have no insurance coverage,1 with as much as 25% of the population uninsured. As the U… 
Highly Cited
1994
Highly Cited
1994
  • C. Papadimitriou
  • Journal of computer and system sciences (Print)
  • 1994
  • Corpus ID: 11038147