You do not have permission to delete messages in this group
Copy link
Report message
Show original message
Either email addresses are anonymous for this group or you need the view member email addresses permission to view the original message
to Computational Complexity, Spring 2010
can someone please explain the answer this question? With one
quantifier doesn't this question become parallel to SAT, which makes
it impossible to solve in P? does the n=log(m) play a significant role
in the answer?
Thanks!
Ofir
unread,
Jul 24, 2010, 8:21:25 AM7/24/10
Reply to author
Sign in to reply to author
Forward
Sign in to forward
Delete
You do not have permission to delete messages in this group
Copy link
Report message
Show original message
Either email addresses are anonymous for this group or you need the view member email addresses permission to view the original message
to Computational Complexity, Spring 2010
כן, זה בדיוק למה התשובה היא איך שהיא.
אם יש logm משתנים אז יש m השמות אפשריות, נכון? (שתיים ב<->לוג). אז בעצם מה שצריך לעשות זה לעבור על m אפשרויות (שזה פולינומי (אפילו לינארי?) באורך הקלט), ולזכור.