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

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

Related topics

Related topics

14 relations
Boolean satisfiability problemComplexity classComputational complexity theoryDecision problem
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
The Complexity of Finding Reset Words in Finite Automata
We study several problems related to finding reset words in deterministic finite automata. In particular, we establish that the… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2010
2010
Polymer Stabilized Nanosuspensions Formed via Flash Nanoprecipitation: Nanoparticle Formation, Formulation, and Stability
Nanoparticles loaded with hydrophobic components (e.g., active pharmaceutical ingredients, medical diagnostic agents, nutritional… Expand
  • figure 1.1
  • figure 2.1
  • table 2.1
  • figure 2.2
  • figure 2.3
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Discovering Relative Importance of Skyline Attributes
Querying databases with preferences is an important research problem. Among various approaches to querying with preferences, the… Expand
  • figure 4
  • figure 5
  • figure 7
  • figure 9
  • figure 8
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Signing a Linear Subspace: Signature Schemes for Network Coding
Network coding offers increased throughput and improved robustness to random faults in completely decentralized networks. In… Expand
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Axially deformed solution of the Skyrme-Hartree-Fock-Bogolyubov equations using the transformed harmonic oscillator basis. The program HFBTHO (v1.66p)
We describe the program HFBTHO for axially deformed configurational Hartree–Fock–Bogolyubov calculations with Skyrme-forces and… Expand
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2002
Highly Cited
2002
A New, Fully Automatic Version of Mitkov's Knowledge-Poor Pronoun Resolution Method
This paper describes a new, advanced and completely revamped version of Mitkov's knowledge-poor approach to pronoun resolution… Expand
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
2001
2001
The Coinvariant Algebra and Representation Types of Blocks of Category O
Let G be a finite-dimensional semisimple Lie algebra over the complex numbers. Let A be the finite-dimensional algebra of a… Expand
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Forecasting methods using fuzzy concepts
In this paper, fuzzy concepts are applied in forecasting product price and sales in the semiconductor industry which is often… Expand
Is this relevant?
1996
1996
Defining Nurse Practitioner Scope of Practice: Expanding Primary Care Services
INTRODUCTION Fifty-eight million Americans have no insurance coverage,1 with as much as 25% of the population uninsured. As the U… Expand
  • table 1
  • table 3
  • table 2
  • table 4
Is this relevant?
Highly Cited
1994
Highly Cited
1994
On the Complexity of the Parity Argument and Other Inefficient Proofs of Existence
We define several new complexity classes of search problems, ''between'' the classes FP and FNP. These new classes are contained… Expand
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE