EUVIMEDEUVIMED entdecken
Crossref

Conceptual models linking polynomial-time computation and non-deterministic verification

Paul TE Cusack

Journal of Mathematical Problems, Equations and Statistics · 01.01.2026 · 7 (1) · 219-220

DOI: 10.22271/math.2026.v7.i1b.337 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Mathematical Problems, Equations and Statistics, online erschienen am 01.01.2026. Verfasst von Paul TE Cusack.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Zitieren

APA

Cusack, P. T. (2026). Conceptual models linking polynomial-time computation and non-deterministic verification. Journal of Mathematical Problems, Equations and Statistics, 7(1), 219-220. https://doi.org/10.22271/math.2026.v7.i1b.337

Vancouver

Cusack PT. Conceptual models linking polynomial-time computation and non-deterministic verification. Journal of Mathematical Problems, Equations and Statistics. 2026;7(1):219-220. doi:10.22271/math.2026.v7.i1b.337

BibTeX
@article{Cusack2026,
  author = {Cusack, Paul TE},
  title = {Conceptual models linking polynomial-time computation and non-deterministic verification},
  journal = {Journal of Mathematical Problems, Equations and Statistics},
  year = {2026},
  volume = {7},
  number = {1},
  pages = {219--220},
  doi = {10.22271/math.2026.v7.i1b.337}
}
Kostenlos starten →