Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 211,150,399 papers from all fields of science
Search
Sign In
Create Free Account
List of NP-complete problems
Known as:
List of np complete problems
, Solvability of equations
This is a list of some of the more commonly known problems that are NP-complete when expressed as decision problems. As there are hundreds of such…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
3-dimensional matching
Acta Informatica
Battleship (puzzle)
Berth allocation problem
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Review
2015
Review
2015
Differential-Algebraic Equations from a Functional-Analytic Viewpoint: A Survey
R. März
2015
Corpus ID: 116281915
The purpose of this paper is to provide an overview on the state of the art concerning functional-analytic properties associated…
Expand
2012
2012
Numerical Solutions of Kahler-Einstein metrics on $P^2$ with conical singularities along a conic curve
Chi Li
2012
Corpus ID: 119467583
We solve for the SO(3)-invariant Kahler-Einstein metric on $\mathbb{P}^2$ with cone singularities along a smooth conic curve…
Expand
2006
2006
Solvability of Equations in Graph Groups Is Decidable
V. Diekert
,
A. Muscholl
International journal of algebra and computation
2006
Corpus ID: 1975140
We show that the existential theory of free partially commutative monoids with involution is decidable. As a consequence the…
Expand
2001
2001
On Diffusive Equilibria in Generalized Kinetic Theory
C. Cercignani
,
R. Illner
,
C. Stoica
2001
Corpus ID: 115383828
AbstractWe investigate the solvability of equations Q(f,f)+∈2Δf=0 in term of nonnegative integrable densities f∈L1+(R3). Here…
Expand
2001
2001
Preduals of Campanato Spaces and Sobolev-Campanato Spaces: A General Construction
K. Gröger
,
L. Recke
2001
Corpus ID: 14330373
In this paper we describe two limiting processes for families of Banach spaces closely related to the standard de nition of…
Expand
1998
1998
Satisfiability of word equations with constants is in exponential space
C. Gutiérrez
Proceedings 39th Annual Symposium on Foundations…
1998
Corpus ID: 14273125
In this paper we study solvability of equations over free semigroups, known as word equations, particularly G.S. Makanin's…
Expand
1995
1995
The Complexity of the Morphism Equivalence Problem for Context-Free Languages
W. Plandowski
1995
Corpus ID: 116035259
1987
1987
Coding in the existential theory of concatenation
J. R. Büchi
,
S. Senger
Archive for Mathematical Logic
1987
Corpus ID: 31157052
We will show (Theorem I) that every existentially definable relation over concatenation is diophantine. That is, it can be…
Expand
Highly Cited
1977
Highly Cited
1977
The Problem of Solvability of Equations in a Free Semigroup
G. Makanin
1977
Corpus ID: 7073856
In this paper we construct an algorithm recognizing the solvability of arbitrary equations in a free semigroup.Bibliography: 4…
Expand
Highly Cited
1975
Highly Cited
1975
On the approximation-solvability of equations involving $A$-proper and pseudo-$A$-proper mappings
W. V. Petryshyn
1975
Corpus ID: 2940362
Introduction 1. .4-proper mappings and fixed point theorems for Py-compact mappings 1.1 Basic facts about ^-proper mappings and…
Expand
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