Artificial Intelligence - هوش مصنوعی  
انجمن را در گوگل محبوب کنيد :

بازگشت   Artificial Intelligence - هوش مصنوعی > مقالات و اسلاید ها > مقالات و اسلایدهای انگلیسی مرتبط با هوش مصنوعی

تبليغات سايت
Iranian Association for the Advancement of Artificial Intelligence
ارسال تاپيک جديد  پاسخ
LinkBack ابزارهاي تاپيک نحوه نمايش
قديمي ۰۱-۲۳-۱۳۹۴, ۰۵:۲۶ بعد از ظهر   #1 (لینک دائم)
عضو فوق فعال
آواتار Salam2012
تاريخ عضويت: مهر ۱۳۸۹
پست ها: 63
تشكرها: 0
8 تشكر در 5 پست
ارسال پيغام Yahoo به Salam2012
Exclamation Michael LaPlante's paper on NP=P

I read the paper of "Michael LaPlante" entitle "A polynomial time algorithm for solving clique problems" and here is my commecnt on the paper:

Author claim that have a polynomial algorithm

for Maximum Clique and K-Clique problems.

The algorithm first finds the 3-Cliques,
obviously this process is polynomial because
only n*(n-1)*(n-2) ternary relation exists.
And we can easily find whole of them in a
n^3 process. But then author wish to assemble them
to produce cliques of bigger sizes.
As I see in figure 3F , 3H, 4F, 4I I think author
only consider the case when algorithm begins to
merging, it only merges the cliques they are maximum
where when you have a graph of 100 or 1000 nodes
you may begin to mergeing but the nodes that you
merged be wrong having a bigger clique using defferent
merging process. In fact the problem is that when you
want to merge them, there are many decision points and
milions number of different merging process. Yes it is
complexity of NP-Completes! let me know if I'm wrong.
Thus the algorithm is only a greedy algorithm that finds
some cliques but dont garantee they be maximum clique or
bigger than a special number K.
In fact the algorithm is correct if you add try and error
to it but is not polynomial.

Best wishes,
Kavosh Havaledarnejad
Salam2012 آفلاين است   پاسخ با نقل قول

نشان دهنده تبلیغات
تاريخ عضويت: -
محل سكونت: -
سن: 2010
پست ها: -

نشان دهنده تبلیغات is online  

كاربران در حال ديدن تاپيک: 1 (0 عضو و 1 مهمان)
ابزارهاي تاپيک
نحوه نمايش

قوانين ارسال
You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts

BB code is فعال
شکلکها فعال است
كد [IMG] فعال است
كدهاي HTML غير فعال است
Trackbacks are فعال
Pingbacks are فعال
Refbacks are فعال

زمان محلي شما با تنظيم GMT +3.5 هم اکنون ۰۸:۱۰ قبل از ظهر ميباشد.

Powered by vBulletin® Version 3.8.3
Copyright ©2000 - 2024, Jelsoft Enterprises Ltd.
Search Engine Friendly URLs by vBSEO 3.1.0 ©2007, Crawlability, Inc.

Teach and Learn at Hexib | Sponsored by and Product In Review

استفاده از مطالب انجمن در سایر سایت ها، تنها با ذکر انجمن هوش مصنوعي به عنوان منبع و لینک مستقیم به خود مطلب مجاز است

Inactive Reminders By Icora Web Design