TL;DR
This paper explores geometric methods to address the P versus NP problem, highlighting the role of group actions and proposing geometric definitions of complexity classes to advance understanding in computational complexity.
Contribution
It introduces three geometric approaches to P vs NP, illustrating the role of group actions and proposing geometric definitions of complexity classes.
Findings
Illustrates the role of group actions in complexity theory
Proposes initial geometric definitions of complexity classes
Presents results connecting geometry and computational complexity
Abstract
I describe three geometric approaches to resolving variants of P v. NP, present several results that illustrate the role of group actions in complexity theory, and make a first step towards completely geometric definitions of complexity classes.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Graph Labeling and Dimension Problems · Advanced Graph Theory Research