Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,206,854 papers from all fields of science
Search
Sign In
Create Free Account
NP-easy
In complexity theory, the complexity class NP-easy is the set of function problems that are solvable in polynomial time by a deterministic Turing…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
12 relations
Complexity class
Computational complexity theory
Decision problem
Function problem
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
THE DEBTS’ CLEARING PROBLEM’S RELATION WITH COMPLEXITY CLASSES
C. Patcas
2013
Corpus ID: 44744145
The debts’ clearing problem is about clearing all the debts in a group of n entities (eg. persons, companies) using a minimal…
Expand
2009
2009
Symbolic Techniques in Propositional Satisfiability Solving
Moshe Y. Vardi
International Conference on Theory and…
2009
Corpus ID: 21051253
Search-based techniques in propositional satisfiability (SAT) solving have been enormously successful, leading to what is…
Expand
2002
2002
Take It NP-Easy: Bounded Model Construction for Duration Calculus
M. Fränzle
Formal Techniques in Real-Time and Fault-Tolerant…
2002
Corpus ID: 38728562
Following the recent successes of bounded model-checking, we reconsider the problem of constructing models of discrete-time…
Expand
1995
1995
How difficult is the frequency selection problem?
S. Jacobson
Operations Research Letters
1995
Corpus ID: 34683777
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