Skip to search formSkip to main contentSkip to account menu

NP-equivalent

In computational complexity theory, the complexity class NP-equivalent is the set of function problems that are both NP-easy and NP-hard. NP… 
Wikipedia (opens in a new tab)

Related topics

Related topics

9 relations
Complexity classComputational complexity theoryDecision problemFunction problem

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
On the relative dual of an $S^1$-gerbe over an orbifold
2012
2012
The syntax of yes-no questions and answers in Thai
............................................................................................ ii Dedication… 
Review
2011
Review
2011
Trade costs in the India-Mekong Subregion: Identifying Policy Priorities for Trade Facilitation
This paper explores the trade facilitation performance of India and Mekong countries using a new measure of bilateral… 
2010
2010
Compact LTCC Rat-Race Couplers Using Multilayered Phase-Delay and Phase-Advance T-Equivalent Sections
In this paper, compact low-temperature co-fired ceramic (LTCC) rat-race couplers are developed using multilayered phase-delay and… 
2009
2009
Matrix pencils and entanglement classification
Quantum entanglement plays a central role in quantum information processing. A main objective of the theory is to classify… 
2008
2008
Any two irreducible Markov chains of equal entropy are finitarily Kakutani equivalent
We show here that any two finite state irreducible Markov chains of the same entropy are finitarily Kakutani equivalent. By this… 
1998
1998
Singularities of Fractions and Behaviour of Polynomials at Innnity
1 Classiication of singularities of fractions In this paper we mean by fraction the ratio (ordered pair) of two germs of… 
1990
1990
Generating program animators from programming language semantics
I present a theory of program animation based on formal semantics. This theory shows how an animator for a language can be… 
1988
1988
Some P.V.-equivalences and a classification of 2-simple prehomogeneous vector spaces of type
A classification of 2-simple prehomogeneous vector spaces is completed by using some P.V.-equivalences together with [3]. Some… 
1983
1983
Narrative Complexity Based on Summarization Algorithms
Narrative structures can only be defined in terms of some internal memory representation, but narrative complexity is more… 
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)