Cover Image

Spectral Expanders, Non-Commutative Diffusion Laplacians, and the Structural Separation of Polynomial-Time Complexity Classes

Fuente: Zenodo

Saved in:

Bibliographic Details
Main Author:	Garrido, Daphne
Format:	Recurso digital
Language:	English
Published:	Zenodo 2026
Subjects:	P vs NP Problem Circuit Complexity Expander Graphs Ramanujan Graphs Graph Laplacian Alon Bound Natural Proofs Barrier Structural Complexity Millennium Prize Problems
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Asymptotic Saturation of Projective Resolution: Expander Relaxation Graphs
by: Beau, Jérôme
Published: (2026)

Asymptotic Saturation of Projective Resolution: Expander Relaxation Graphs
by: Beau, Jérôme
Published: (2026)

P ≠ NP: A Proof via Information Flow Complexity
by: Christian Kilpatrick
Published: (2025)

Complexity Dichotomies for Graph Homomorphism Problems on Restricted Classes
by: SÉRGIO DE ANDRADE, PAULO
Published: (2025)

Topics in Theoretical Computer Science
by: Rode, Alexander Forrest
Published: (2025)

Math puzzles, powerful ideas, algorithms and computers in teaching problem-solving
by: Marco A. Murray Lasso
Published: (2003)

Proving the Non-Equivalence of P and NP: A Logical Reductio ad Absurdum via Holographic Block-Height
by: li, shaoren
Published: (2026)

Maximal Planar Graph Theory and the Four-Color Conjecture
by: Xu, Jin
Published: (2025)

A Formal Proof That P ≠ NP via SAT Space Irreducibility
by: Jorge, G. Pardo
Published: (2025)

A FUNCTIONAL GRAPHIC APPROACH TO INEQUATIONS
by: Vera H. G. de Souza
Published: (2015)

Resolution of the Hodge Conjecture via the Sexagesimal Harmony Algorithm
by: López Miranda, Jorge Alexander
Published: (2026)

The Law of Computational Impossibility (P vs NP)
by: Zain Al-Abedien, (Muhannad)
Published: (2025)

The Hybrid ColorAnt-RT Algorithms and an Application to Register Allocation
by: Carla Negri Lintzmayer
Published: (2015)

On Radio k-Chromatic Number of Various Graphs
by: J Kalaiselvi, et al.
Published: (2024)

Spectral Geometry of Graphs
by: Kurasov, Pavel
Published: (2023)

P vs NP via Ising Energy Landscapes
by: Daugherty, Bryan, et al.
Published: (2026)

Entity Alignment
by: Zhao, Xiang, et al.
Published: (2023)

Characteristics of Duplicate Records in OCLC's Online Union Catalog.
by: O'Neill, Edward T., et al.
Published: (1993)

CFP-MCFP Complete Theorem Proofs: Riemann Hypothesis, Goldbach, Beal, Collatz and 33 Related Results (v2)
by: Mr. NeC B.V.
Published: (2026)

Minimizing the Determinant of the Graph Laplacian
by: Nathan Albin, et al.
Published: (2025)

Relational Three-Space Geometry: Framework v6.0
by: Niko, Jean-Paul
Published: (2026)

Number of Subgraphs and Their Converses in Tournaments and New Digraph Polynomials
by: Jiangdong Ai, et al.
Published: (2025)

A State Sum for the Total Face Color Polynomial
by: Scott Baldridge, et al.
Published: (2025)

PROPAGATE: A Seed Propagation Framework to Compute Distance-Based Metrics on Very Large Graphs
by: Amati, Giambattista, et al.
Published: (2026)

A Unimodal Conjecture Related the Quadruple Sequence on the Series
by: Yang, Limin
Published: (2026)

Chromatic Polynomials of Signed Graphs and Dominating‐Vertex Deletion Formulae
by: Gary R. W. Greaves, et al.
Published: (2025)

The Polynomial Method for Three‐Path Extendability of List Colourings of Planar Graphs
by: Przemysław Gordinowicz, et al.
Published: (2025)

On Endomorphism Universality of Sparse Graph Classes
by: Kolja Knauer, et al.
Published: (2025)

Separating the Edges of a Graph by Cycles and by Subdivisions of K4
by: Fábio Botler, et al.
Published: (2025)

Polynomial bounds for chromatic number VIII. Excluding a path and a complete multipartite graph
by: Tung Nguyen, et al.
Published: (2024)

Maximal Spectral Radius of Minimally k‐(Edge)‐Connected Graphs
by: Mingqing Zhai, et al.
Published: (2025)

On Induced Matching Numbers of Stacked-Book Graphs
by: T. C. Adefokun, et al.
Published: (2024)

CFP-MCFP Complete Theorem Proofs: 78 Slides with Lean 4 Proof Details
by: Mr. NeC B.V.
Published: (2026)

Polynomial Strategies for the 3-Coloring of a Graph.
by: Guillermo De Ita Luna
Published: (2012)

GRAPHIA_WP3_D3.1_AppendixA.json
by: Pescarmona, Giovanni
Published: (2026)

The Generic Circular Triangle‐Free Graph
by: Manuel Bodirsky, et al.
Published: (2025)

The maximum number of maximum generalized 4‐independent sets in trees
by: Pingshan Li, et al.
Published: (2024)

Polyhedra without cubic vertices are prism‐hamiltonian
by: Simon Špacapan
Published: (2024)

B‐Coloring of Planar Graphs
by: Jiangxu Kong, et al.
Published: (2026)

Dense circuit graphs and the planar Turán number of a cycle
by: Ruilin Shi, et al.
Published: (2024)