Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 210,178,046 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
14 relations
Boolean satisfiability problem
Complexity class
Computational complexity theory
Decision problem
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2017
Highly Cited
2017
Prequential AUC: properties of the area under the ROC curve for data streams with concept drift
D. Brzezinski
,
J. Stefanowski
Knowledge and Information Systems
2017
Corpus ID: 19546966
Modern data-driven systems often require classifiers capable of dealing with streaming imbalanced data and concept changes. The…
Expand
2016
2016
Response-time analysis of DAG tasks under fixed priority scheduling with limited preemptions
M. A. Serrano
,
Alessandra Melani
,
M. Bertogna
,
E. Quiñones
Design, Automation and Test in Europe
2016
Corpus ID: 13572773
Limited preemptive (LP) scheduling has been demonstrated to effectively improve the schedulability of fully preemptive (FP) and…
Expand
Review
2015
Review
2015
The Araucaria Project: accurate stellar parameters and distance to evolved eclipsing binary ASAS J180057-2333.8 in Sagittarius Arm
K. Suchomska
,
D. Graczyk
,
+11 authors
R. I. Anderson
2015
Corpus ID: 59397309
We have analyzed the double-lined eclipsing binary system ASAS J180057-2333.8 from the All Sky Automated Survey (ASAS) catalogue…
Expand
Review
2011
Review
2011
Virtual screening strategies in drug design - methods and applications
E. Bielska
,
X. Lucas
,
A. Czerwoniec
,
Joanna M. Kasprzak
,
Katarzyna H. Kaminska
,
J. Bujnicki
2011
Corpus ID: 16492787
Virtual screening (VS) overcomes the limitations of traditional high-throughput screening (HTS) by applying computer-based…
Expand
Highly Cited
2009
Highly Cited
2009
Signing a Linear Subspace: Signature Schemes for Network Coding
D. Boneh
,
D. Freeman
,
Jonathan Katz
,
Brent Waters
IACR Cryptology ePrint Archive
2009
Corpus ID: 10258643
Network coding offers increased throughput and improved robustness to random faults in completely decentralized networks. In…
Expand
Highly Cited
2009
Highly Cited
2009
Discovering Relative Importance of Skyline Attributes
Denis Mindolin
,
Jan Chomicki
Proceedings of the VLDB Endowment
2009
Corpus ID: 14145365
Querying databases with preferences is an important research problem. Among various approaches to querying with preferences, the…
Expand
Highly Cited
2002
Highly Cited
2002
A New, Fully Automatic Version of Mitkov's Knowledge-Poor Pronoun Resolution Method
R. Mitkov
,
R. Evans
,
Constantin Orasan
Conference on Intelligent Text Processing and…
2002
Corpus ID: 18506901
This paper describes a new, advanced and completely revamped version of Mitkov's knowledge-poor approach to pronoun resolution…
Expand
2001
2001
The Coinvariant Algebra and Representation Types of Blocks of Category O
T. Brüstle
,
S. Konig
,
V. Mazorchuk
2001
Corpus ID: 14066698
Let G be a finite‐dimensional semisimple Lie algebra over the complex numbers. Let A be the finite‐dimensional algebra of a…
Expand
1996
1996
Defining Nurse Practitioner Scope of Practice: Expanding Primary Care Services
G. Sherwood
,
Mary-Michael Brown
,
V. Fay
,
D. Wardell
1996
Corpus ID: 74179376
INTRODUCTION Fifty-eight million Americans have no insurance coverage,1 with as much as 25% of the population uninsured. As the U…
Expand
Highly Cited
1994
Highly Cited
1994
On the Complexity of the Parity Argument and Other Inefficient Proofs of Existence
C. Papadimitriou
Journal of computer and system sciences (Print)
1994
Corpus ID: 11038147
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE