Saved in:
| Main Author: | |
|---|---|
| Format: | Recurso digital |
| Language: | |
| Published: |
Zenodo
2025
|
| Online Access: | https://doi.org/10.5281/zenodo.17582138 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- <p>The present invention relates generally to computer-implemented optimization and decision systems, and more particularly to deterministic methods for solving combinatorial graph problems within polynomial time bounds. The invention resides in the technical field of computational complexity, graph theory, and algorithmic optimization executed by digital computing systems. It concerns a computer-implemented architecture and method that identify maximum cliques and equivalent combinatorial structures using a sequence of certified graph reductions, canonical state representations, and deterministic control of execution flow. In broader embodiments, the invention applies to the reduction of NP-complete and NP-hard decision or optimization problems to canonical graph instances that are solved deterministically by the same framework. The disclosed techniques pertain to artificial intelligence search optimization, database indexing and query planning, cryptographic verification, electronic design automation, and other dataintensive computational domains that require predictable, reproducible, and energy-efficient algorithmic performance.</p>