Solution of the Problem P = L

The problems associated with the construction of polynomial complexity computer programs require new techniques and approaches from mathematicians. One of such approaches is representing some class of polynomial algorithms as a certain class of special logical programs. Goncharov and Sviridenko desc...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Mathematics (Basel) Ročník 10; číslo 1; s. 113
Hlavní autori:	Goncharov, Sergey, Nechesov, Andrey
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Basel MDPI AG 01.01.2022
Predmet:	Algorithms Complexity High level languages Iterative methods logical programming language Mathematical models Mathematics polynomial algorithm polynomial function polynomiality Polynomials Programming languages semantic programming Semantics Software Turing machine Turing machines
ISSN:	2227-7390, 2227-7390
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!