Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
3-dimensional matchingActa InformaticaBattleship (puzzle)Berth allocation problem

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
On solvability of regular equations in the variety of metabelian groups
We study the solvability of equations over groups within a given variety or another class of groups. The classes of nilpotent and… 
2001
2001
On Diffusive Equilibria in Generalized Kinetic Theory
AbstractWe investigate the solvability of equations Q(f,f)+∈2Δf=0 in term of nonnegative integrable densities f∈L1+(R3). Here… 
2001
2001
Preduals of Campanato Spaces and Sobolev-Campanato Spaces: A General Construction
In this paper we describe two limiting processes for families of Banach spaces closely related to the standard de nition of… 
Review
2001
Review
2001
Simple Words in Equality Sets
It is well known that equality sets between two morphisms possess a remarkable generative capacity: an arbitrary recursively… 
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… 
1996
1996
Decision Problems concerning Prime Words and Languages of the Pcp
This paper investigates properties of prime words and prime languages obtained from the Post Correspondence Problem. We show that… 
1995
1995
The Complexity of the Morphism Equivalence Problem for Context-Free Languages
1995
1995
Nonlinear demi-regular approximation solvability of equations involving strongly accretive operators
Based on the demiregular convergence theory of the operator equations involving strongly monotone operators by Anselone and Lei… 
1990
1990
An Analysis of Makanin's Algorithm Deciding Solvability of Equations in Free Groups
We give slightly simplified version of the proof of Makanin's theorem on decidability of solvability problem for equations in… 
1987
1987
Coding in the existential theory of concatenation
We will show (Theorem I) that every existentially definable relation over concatenation is diophantine. That is, it can be… 
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)