Use your computer fearlessly.

Mission Services Articles Research

everyone: older news

business: Worms

Press Release

by Brent Kirkpatrick

(Date Published: .)


P=NP is a problem that comes from complexity theory an area established by Richard Karp. Professor Karp was interested in the question whether there were problems that are only inefficient. This observation inspired a generation of computer scientists and mathematicians. The conjecture that P≠NP has been closoed by Dr. Brent Kirkpatrick who proved that the maximum clique problem is solvable in polynomial time. This means that P=NP.

The paper is currently available: Cliques in graphs.

-- Brent Kirkpatrick
        from Montana, U.S. on September 30, 2022


Please contact us at Intrepid Net Computing if you want to ask questions.

defendIT image

defendIT (TM). AI-driven incident response measures derived from security incident data.

Business Articles

New Technologies for a New Cybersecurity Marketplace

Panther Shadow: A Linux Worm


Why Clean-Up Hacking?

INC Logo

What Is New? | Contact | Tips

© 2015-2023 Intrepid Net Computing. All rights reserved.