Vwwxrf

Why can't I see bouncing of a switch on an oscilloscope?

Is it legal for company to use my work email to pretend I still work there?

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?

Theorems that impeded progress

Schoenfled Residua test shows proportionality hazard assumptions holds but Kaplan-Meier plots intersect

Test if tikzmark exists on same page

Modeling an IP Address

What do the dots in this tr command do: tr .............A-Z A-ZA-Z <<< "JVPQBOV" (with 13 dots)

US citizen flying to France today and my passport expires in less than 2 months

Email Account under attack (really) - anything I can do?

Why does Kotter return in Welcome Back Kotter?

Why do falling prices hurt debtors?

Why was the small council so happy for Tyrion to become the Master of Coin?

can i play a electric guitar through a bass amp?

What are these boxed doors outside store fronts in New York?

Why do I get two different answers for this counting problem?

Fencing style for blades that can attack from a distance

Can an x86 CPU running in real mode be considered to be basically an 8086 CPU?

How much RAM could one put in a typical 80386 setup?

What defenses are there against being summoned by the Gate spell?

Watching something be written to a file live with tail

Can divisibility rules for digits be generalized to sum of digits

What is the offset in a seaplane's hull?

Dragon forelimb placement

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?

1

$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

share|cite|improve this question

asked 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$

• 
  
  
  

  
  2
  

  
  
  
  
  
  

  
  $begingroup$
  Try using the definitions.
  $endgroup$
  – Yuval Filmus
  2 hours ago
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  @YuvalFilmus thanks for the advice, this helped me figure it out!
  $endgroup$
  – Ankit Bahl
  1 hour ago
  

  
  
  
  

add a comment | 

1

$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

share|cite|improve this question

asked 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$

• 
  
  
  

  
  2
  

  
  
  
  
  
  

  
  $begingroup$
  Try using the definitions.
  $endgroup$
  – Yuval Filmus
  2 hours ago
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  @YuvalFilmus thanks for the advice, this helped me figure it out!
  $endgroup$
  – Ankit Bahl
  1 hour 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

share|cite|improve this question

asked 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$

share|cite|improve this question

asked 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.

share|cite|improve this question

asked 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.

asked 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.

asked 2 hours ago

Ankit BahlAnkit Bahl

262

1 Answer
1

active

oldest

votes

2

$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)$

1. Take input $i$ and apply $m$ to yield $m(i)$
   


2. 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.

share|cite|improve this answer

answered 1 hour 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.

draft saved

draft discarded

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

Name

Email

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

Name

Email

Required, but never shown

2

$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)$

1. Take input $i$ and apply $m$ to yield $m(i)$
   


2. 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.

share|cite|improve this answer

answered 1 hour 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 | 

2

$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)$

1. Take input $i$ and apply $m$ to yield $m(i)$
   


2. 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.

share|cite|improve this answer

answered 1 hour 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)$

1. Take input $i$ and apply $m$ to yield $m(i)$
   


2. 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.

share|cite|improve this answer

answered 1 hour 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$

share|cite|improve this answer

answered 1 hour 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 1 hour 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 1 hour ago

Ankit BahlAnkit Bahl

262