Metraipolis › archive › dc_78fa2e7e9987
Solving hard computational problems efficiently: asymptotic parametric complexity 3-coloring algorithm — Europe PMC PMID:23349711
- Source
- Europe PMC (en)
- Original
- https://europepmc.org/article/MED/23349711
- DOI
- 10.1371/journal.pone.0053437
- License (as archived)
- solo-consultazione
- Archived
- 2026-10-10T00:54:55.151Z
- SHA-256 of the archived text
cc01e88a51af8d13066e49399fbb745559334270a13f76e58a55bda5356008b0- Stable URL of this page
https://metraipolis.com/documento/dc_78fa2e7e9987
How to cite
Solving hard computational problems efficiently: asymptotic parametric complexity 3-coloring algorithm — Europe PMC PMID:23349711 — Europe PMC (en), https://europepmc.org/article/MED/23349711 (solo-consultazione); archived copy: https://metraipolis.com/documento/dc_78fa2e7e9987 (Metraipolis archive dc_78fa2e7e9987, sha256 cc01e88a51af8d13066e49399fbb745559334270a13f76e58a55bda5356008b0)
BibTeX
@misc{dc78fa2e7e9987,
title = {Solving hard computational problems efficiently: asymptotic parametric complexity 3-coloring algorithm — Europe PMC PMID:23349711},
howpublished = {Europe PMC (en)},
url = {https://europepmc.org/article/MED/23349711},
note = {License solo-consultazione; archived copy https://metraipolis.com/documento/dc_78fa2e7e9987; sha256 cc01e88a51af8d13066e49399fbb745559334270a13f76e58a55bda5356008b0},
year = {2026}
}Archived text
The text is not reproduced here: the archive holds it as solo-consultazione (consultation only, no republication). Read it at the original source: https://europepmc.org/article/MED/23349711. Agents can read the archived copy with the MCP tool read_document.