NP-complete Problems can be Solved and Verified in Polynomial Time

In this short paper we give the final resolution of “P versus NP” theorem according to our previous results obtained in the field of automaton implementation for extended regular expressions and generally intersection operator.

Authors

Publication Details

Published
2025-10-08
DOI
https://doi.org/10.31224/5533
Primary Topic
semigroups and automata theory
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

NP-complete Problems can be Solved and Verified in Polynomial Time

Mirzakhmet Syzdykov
semigroups and automata theory
article

NP-complete Problems can be Solved and Verified in Polynomial Time

Mirzakhmet Syzdykov
article en

Abstract

In this short paper we give the final resolution of “P versus NP” theorem according to our previous results obtained in the field of automaton implementation for extended regular expressions and generally intersection operator.

Openalex Percentile: Top 71%
semigroups and automata theory
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.

NP-complete Problems can be Solved and Verified in Polynomial Time — Mirzakhmet Syzdykov · (2025) | TGRS Research Map | TGRS