Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 236,451,109 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
9 relations
Complexity class
Computational complexity theory
Decision problem
Function problem
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Homotopy theory in a quasi-abelian category.
James Wallbridge
2015
Corpus ID: 119128816
We prove that the category of dg-modules and dg-algebras in a Grothendieck quasi-abelian category are endowed with a Quillen…
Expand
2012
2012
The syntax of yes-no questions and answers in Thai
Somphob Yaisomanang
2012
Corpus ID: 60124144
............................................................................................ ii Dedication…
Expand
2012
2012
Polynomial functions of degree 20 which are APN infinitely often
Florian Caullery
arXiv.org
2012
Corpus ID: 1693899
We give all the polynomials functions of degree 20 which are APN over an infinity of field extensions and show they are all CCZ…
Expand
2011
2011
Spectrophotometric Determination of Total Phenol and Flavanoid Content in Manjakani (Quercus Infectoria) Extracts
R. Rina
2011
Corpus ID: 1582017
Previous research showed that manjakani (Quercus infectoria) has the antioxidant property. However, the entity involved in…
Expand
2009
2009
An example of Kakutani equivalent and strong orbit equivalent substitution systems that are not conjugate
Brett M. Werner
2009
Corpus ID: 33056504
We present an example of Kakutani equivalent and strong orbit equivalent substitution systems that are not conjugate.
2006
2006
On the irreducibility of a class of polynomials
Arithmetica Lxii
2006
Corpus ID: 16634174
To the memory of Z. Z. Papp 1. Introduction. In this paper, we continue our investigations (cf. [5], [6], [9]) concerning…
Expand
2001
2001
On the Complexity of Planning in Transportation and Manipulation Domains
M. Helmert
2001
Corpus ID: 17685028
Acknowledgments I want to thank all people who (in some way or other) helped me complete this thesis. Specifically, I want to…
Expand
2000
2000
Stress Projection, Layerwise-Equivalent, Formulation for Accurate Predictions of Transverse Stresses in Laminated Plates and Shells
Jay Z. Yuan
,
A. Saleeb
,
A. Gendy
International Journal of Computational…
2000
Corpus ID: 11078813
A two-phase scheme for accurate predictions of interlaminar stresses in laminated plate and shell structures has been addressed…
Expand
1990
1990
Homological dimensions in a Morita context with applications to subidealizers and fixed rings
P. Loustaunau
,
J. Shapiro
1990
Corpus ID: 115142039
Given a Morita context (R, S, V, W, 0, V/), we investigate the relationship between the various homological dimensions of the…
Expand
1988
1988
Some P.V.-equivalences and a classification of 2-simple prehomogeneous vector spaces of type
Tatsuo Kimura
,
S. Kasai
,
M. Taguchi
,
M. Inuzuka
1988
Corpus ID: 122320926
A classification of 2-simple prehomogeneous vector spaces is completed by using some P.V.-equivalences together with [3]. Some…
Expand