Google Answers Logo
View Question
 
Q: Showing DP-completeness ( No Answer,   0 Comments )
Question  
Subject: Showing DP-completeness
Category: Computers > Algorithms
Asked by: nr9-ga
List Price: $200.00
Posted: 08 Aug 2004 01:28 PDT
Expires: 08 Aug 2004 12:07 PDT
Question ID: 384940
How do you show that Z = {<G1,k1,G2,k2>, G1 has a k1-clique and G2
doesn't have a k2-clique} is DP-complete?

Clarification of Question by nr9-ga on 08 Aug 2004 10:52 PDT
don't assume any previous results about DP-completeness
Answer  
There is no answer at this time.

Comments  
There are no comments at this time.

Important Disclaimer: Answers and comments provided on Google Answers are general information, and are not intended to substitute for informed professional medical, psychiatric, psychological, tax, legal, investment, accounting, or other professional advice. Google does not endorse, and expressly disclaims liability for any product, manufacturer, distributor, service or service provider mentioned or any opinion expressed in answers or comments. Please read carefully the Google Answers Terms of Service.

If you feel that you have found inappropriate content, please let us know by emailing us at answers-support@google.com with the question ID listed above. Thank you.
Search Google Answers for
Google Answers  


Google Home - Answers FAQ - Terms of Service - Privacy Policy