Full article and certificates for the short note: The determinantal complexity of the 4*4 permanent is 15

This resource provides a full-length article will full proofs, and certificates, for https://arxiv.org/abs/2611.06658 and https://eccc.weizmann.ac.il/report/2026/309/

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-11
DOI
https://doi.org/10.5281/zenodo.24124958
Primary Topic
Complexity and Algorithms in Graphs
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Full article and certificates for the short note: The determinantal complexity of the 4*4 permanent is 15

Karthik Sheshadri
Zenodo (CERN European Organization for Nuclear Research)
Complexity and Algorithms in Graphs
article

Full article and certificates for the short note: The determinantal complexity of the 4*4 permanent is 15

Karthik Sheshadri
article en

Abstract

This resource provides a full-length article will full proofs, and certificates, for https://arxiv.org/abs/2611.06658 and https://eccc.weizmann.ac.il/report/2026/309/

Zenodo (CERN European Organization for Nuclear Research)
Complexity and Algorithms in Graphs
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon
Full article and certificates for the short note: The determinantal complexity of the 4*4 permanent is 15 — Karthik Sheshadri · Zenodo (CERN European Organization for Nuclear Research) (2026) | TGRS Research Map | TGRS