Prove that NP is closed under karp reduction?Space(n) not closed under Karp reductions - what about NTime(n)?Class P is closed under rotation?Prove or disprove that $NL$ is closed under polynomial many-one reductions$mathbfNC_2$ is closed under log-space reductionOn Karp reductionwhen can I know if a class (complexity) is closed under reduction (cook/karp)Check if class $PSPACE$ is closed under polyonomially space reductionIs NPSPACE also closed under polynomial-time reduction and under log-space reduction?Prove PSPACE is closed under complement?Prove PSPACE is closed under union?
Do I have a twin with permutated remainders?
How do I create uniquely male characters?
Why doesn't Newton's third law mean a person bounces back to where they started when they hit the ground?
How is the claim "I am in New York only if I am in America" the same as "If I am in New York, then I am in America?
"to be prejudice towards/against someone" vs "to be prejudiced against/towards someone"
How can bays and straits be determined in a procedurally generated map?
How to find program name(s) of an installed package?
How did the USSR manage to innovate in an environment characterized by government censorship and high bureaucracy?
Mage Armor with Defense fighting style (for Adventurers League bladeslinger)
Can I ask the recruiters in my resume to put the reason why I am rejected?
Is it possible to do 50 km distance without any previous training?
How does strength of boric acid solution increase in presence of salicylic acid?
Is it tax fraud for an individual to declare non-taxable revenue as taxable income? (US tax laws)
Characters won't fit in table
Smoothness of finite-dimensional functional calculus
Approximately how much travel time was saved by the opening of the Suez Canal in 1869?
Do VLANs within a subnet need to have their own subnet for router on a stick?
How to write a macro that is braces sensitive?
Is a conference paper whose proceedings will be published in IEEE Xplore counted as a publication?
Show that if two triangles built on parallel lines, with equal bases have the same perimeter only if they are congruent.
Minkowski space
Can an x86 CPU running in real mode be considered to be basically an 8086 CPU?
What does it mean to describe someone as a butt steak?
A newer friend of my brother's gave him a load of baseball cards that are supposedly extremely valuable. Is this a scam?
Prove that NP is closed under karp reduction?
Space(n) not closed under Karp reductions - what about NTime(n)?Class P is closed under rotation?Prove or disprove that $NL$ is closed under polynomial many-one reductions$mathbfNC_2$ is closed under log-space reductionOn Karp reductionwhen can I know if a class (complexity) is closed under reduction (cook/karp)Check if class $PSPACE$ is closed under polyonomially space reductionIs NPSPACE also closed under polynomial-time reduction and under log-space reduction?Prove PSPACE is closed under complement?Prove PSPACE is closed under union?
$begingroup$
A complexity class $mathbbC$ is said to be closed under a reduction if:
$A$ reduces to $B$ and $B in mathbbC$ $implies$ $A in mathbbC$
How would you go about proving this if $mathbbC = NP$ and the reduction to be the karp reduction? i.e.
Prove that if $A$ karp reduces to $B$ and $B in NP$ $implies$ $A in NP$
complexity-theory
asked 3 hours ago
Ankit BahlAnkit Bahl
262
New contributor
Ankit Bahl is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
add a comment |
$begingroup$
A complexity class $mathbbC$ is said to be closed under a reduction if:
$A$ reduces to $B$ and $B in mathbbC$ $implies$ $A in mathbbC$
How would you go about proving this if $mathbbC = NP$ and the reduction to be the karp reduction? i.e.
Prove that if $A$ karp reduces to $B$ and $B in NP$ $implies$ $A in NP$
complexity-theory
asked 3 hours ago
Ankit BahlAnkit Bahl
262
New contributor
Ankit Bahl is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
2
$begingroup$
Try using the definitions.
$endgroup$
– Yuval Filmus
3 hours ago
$begingroup$
@YuvalFilmus thanks for the advice, this helped me figure it out!
$endgroup$
– Ankit Bahl
2 hours ago
add a comment |
$begingroup$
A complexity class $mathbbC$ is said to be closed under a reduction if:
$A$ reduces to $B$ and $B in mathbbC$ $implies$ $A in mathbbC$
How would you go about proving this if $mathbbC = NP$ and the reduction to be the karp reduction? i.e.
Prove that if $A$ karp reduces to $B$ and $B in NP$ $implies$ $A in NP$
complexity-theory
asked 3 hours ago
Ankit BahlAnkit Bahl
262
New contributor
Ankit Bahl is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
A complexity class $mathbbC$ is said to be closed under a reduction if:
$A$ reduces to $B$ and $B in mathbbC$ $implies$ $A in mathbbC$
How would you go about proving this if $mathbbC = NP$ and the reduction to be the karp reduction? i.e.
Prove that if $A$ karp reduces to $B$ and $B in NP$ $implies$ $A in NP$
complexity-theory
complexity-theory
asked 3 hours ago
Ankit BahlAnkit Bahl
262
New contributor
Ankit Bahl is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 3 hours ago
Ankit BahlAnkit Bahl
262
New contributor
Ankit Bahl is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 3 hours ago
Ankit BahlAnkit Bahl
262
New contributor
Ankit Bahl is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 3 hours ago
Ankit BahlAnkit Bahl
262
asked 3 hours ago
Ankit BahlAnkit Bahl
262
262
New contributor
Ankit Bahl is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
Ankit Bahl is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
Ankit Bahl is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
2
$begingroup$
Try using the definitions.
$endgroup$
– Yuval Filmus
3 hours ago
$begingroup$
@YuvalFilmus thanks for the advice, this helped me figure it out!
$endgroup$
– Ankit Bahl
2 hours ago
add a comment |
2
$begingroup$
Try using the definitions.
$endgroup$
– Yuval Filmus
3 hours ago
$begingroup$
@YuvalFilmus thanks for the advice, this helped me figure it out!
$endgroup$
– Ankit Bahl
2 hours ago
2
2
$begingroup$
Try using the definitions.
$endgroup$
– Yuval Filmus
3 hours ago
$begingroup$
Try using the definitions.
$endgroup$
– Yuval Filmus
3 hours ago
$begingroup$
@YuvalFilmus thanks for the advice, this helped me figure it out!
$endgroup$
– Ankit Bahl
2 hours ago
$begingroup$
@YuvalFilmus thanks for the advice, this helped me figure it out!
$endgroup$
– Ankit Bahl
2 hours ago
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
I was able to figure it out. In case anyone was wondering:
$B in NP$ means that there exists a non-deterministic polynomial time algorithm for $B$. Let's call that $b(i)$, where i is the input to $B$.
$A$ karp reducing to $B implies$ that there exists a function $m$ such that $m$ can take an input $i$ to $A$ and map it to some input $m(i)$ for $B$, and if an instance of $i$ is true for $A$ then $m(i)$ is true for B (and vice versa),
Therefore, an algorithm for $A$ can be made as follows:
$A (i)$
- Take input $i$ and apply $m$ to yield $m(i)$
- Apply $b$ with input $m(i)$
This yields an output for $A$. Since both $m$ and $b$ are non-deterministic polynomial time, this algorithm is non-deterministic polynomial time. Therefore $A$ must be in NP.
answered 2 hours ago
Ankit BahlAnkit Bahl
262
New contributor
Ankit Bahl is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
add a comment |
Your Answer
StackExchange.ifUsing("editor", function ()
return StackExchange.using("mathjaxEditing", function ()
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
);
);
, "mathjax-editing");
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "419"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);
else
createEditor();
);
function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);
);
Ankit Bahl is a new contributor. Be nice, and check out our Code of Conduct.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcs.stackexchange.com%2fquestions%2f106574%2fprove-that-np-is-closed-under-karp-reduction%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
I was able to figure it out. In case anyone was wondering:
$B in NP$ means that there exists a non-deterministic polynomial time algorithm for $B$. Let's call that $b(i)$, where i is the input to $B$.
$A$ karp reducing to $B implies$ that there exists a function $m$ such that $m$ can take an input $i$ to $A$ and map it to some input $m(i)$ for $B$, and if an instance of $i$ is true for $A$ then $m(i)$ is true for B (and vice versa),
Therefore, an algorithm for $A$ can be made as follows:
$A (i)$
- Take input $i$ and apply $m$ to yield $m(i)$
- Apply $b$ with input $m(i)$
This yields an output for $A$. Since both $m$ and $b$ are non-deterministic polynomial time, this algorithm is non-deterministic polynomial time. Therefore $A$ must be in NP.
answered 2 hours ago
Ankit BahlAnkit Bahl
262
New contributor
Ankit Bahl is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
add a comment |
$begingroup$
I was able to figure it out. In case anyone was wondering:
$B in NP$ means that there exists a non-deterministic polynomial time algorithm for $B$. Let's call that $b(i)$, where i is the input to $B$.
$A$ karp reducing to $B implies$ that there exists a function $m$ such that $m$ can take an input $i$ to $A$ and map it to some input $m(i)$ for $B$, and if an instance of $i$ is true for $A$ then $m(i)$ is true for B (and vice versa),
Therefore, an algorithm for $A$ can be made as follows:
$A (i)$
- Take input $i$ and apply $m$ to yield $m(i)$
- Apply $b$ with input $m(i)$
This yields an output for $A$. Since both $m$ and $b$ are non-deterministic polynomial time, this algorithm is non-deterministic polynomial time. Therefore $A$ must be in NP.
answered 2 hours ago
Ankit BahlAnkit Bahl
262
New contributor
Ankit Bahl is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
add a comment |
$begingroup$
I was able to figure it out. In case anyone was wondering:
$B in NP$ means that there exists a non-deterministic polynomial time algorithm for $B$. Let's call that $b(i)$, where i is the input to $B$.
$A$ karp reducing to $B implies$ that there exists a function $m$ such that $m$ can take an input $i$ to $A$ and map it to some input $m(i)$ for $B$, and if an instance of $i$ is true for $A$ then $m(i)$ is true for B (and vice versa),
Therefore, an algorithm for $A$ can be made as follows:
$A (i)$
- Take input $i$ and apply $m$ to yield $m(i)$
- Apply $b$ with input $m(i)$
This yields an output for $A$. Since both $m$ and $b$ are non-deterministic polynomial time, this algorithm is non-deterministic polynomial time. Therefore $A$ must be in NP.
answered 2 hours ago
Ankit BahlAnkit Bahl
262
New contributor
Ankit Bahl is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
I was able to figure it out. In case anyone was wondering:
$B in NP$ means that there exists a non-deterministic polynomial time algorithm for $B$. Let's call that $b(i)$, where i is the input to $B$.
$A$ karp reducing to $B implies$ that there exists a function $m$ such that $m$ can take an input $i$ to $A$ and map it to some input $m(i)$ for $B$, and if an instance of $i$ is true for $A$ then $m(i)$ is true for B (and vice versa),
Therefore, an algorithm for $A$ can be made as follows:
$A (i)$
- Take input $i$ and apply $m$ to yield $m(i)$
- Apply $b$ with input $m(i)$
This yields an output for $A$. Since both $m$ and $b$ are non-deterministic polynomial time, this algorithm is non-deterministic polynomial time. Therefore $A$ must be in NP.
answered 2 hours ago
Ankit BahlAnkit Bahl
262
New contributor
Ankit Bahl is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
answered 2 hours ago
Ankit BahlAnkit Bahl
262
New contributor
Ankit Bahl is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
answered 2 hours ago
Ankit BahlAnkit Bahl
262
answered 2 hours ago
Ankit BahlAnkit Bahl
262
262
New contributor
Ankit Bahl is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
Ankit Bahl is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
Ankit Bahl is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
add a comment |
Ankit Bahl is a new contributor. Be nice, and check out our Code of Conduct.
Ankit Bahl is a new contributor. Be nice, and check out our Code of Conduct.
Ankit Bahl is a new contributor. Be nice, and check out our Code of Conduct.
Ankit Bahl is a new contributor. Be nice, and check out our Code of Conduct.
Thanks for contributing an answer to Computer Science Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcs.stackexchange.com%2fquestions%2f106574%2fprove-that-np-is-closed-under-karp-reduction%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
2
$begingroup$
Try using the definitions.
$endgroup$
– Yuval Filmus
3 hours ago
$begingroup$
@YuvalFilmus thanks for the advice, this helped me figure it out!
$endgroup$
– Ankit Bahl
2 hours ago