Computational Complexity: GI is in P

Intel® Moderncode for Parallel Architectures

Support for developing parallel programming applications on Intel® Architecture.

Computational Complexity: GI is in P

281 Views

Dear community experts,

you are welcome to discuss my paper "Polynomial Time Algorithm for Graph Isomorphism Testing". If you will not find any fatal error in it, then the result will be very important for theoretical computer science and particularly for parallel computing ;)

Does Intel wish to support future development of this algorithm? ;))

Link Copied

0 Replies

Community support is provided during standard business hours (Monday to Friday 7AM - 5PM PST). Other contact methods are available here.

Intel does not verify all solutions, including but not limited to any file transfers that may appear in this community. Accordingly, Intel disclaims all express and implied warranties, including without limitation, the implied warranties of merchantability, fitness for a particular purpose, and non-infringement, as well as any warranty arising from course of performance, course of dealing, or usage in trade.

For more complete information about compiler optimizations, see our Optimization Notice.