On the generic complexity of solving equations over natural numbers with addition
We study the general complexity of the problem of determining the solvability of equations systems over natural numbers with the addition. The NP-completeness of this problem is proved. A polynomial generic algorithm for solving this problem is proposed. It is proved that if P ̸= NP and P = BPP, the...
Gespeichert in:
| Veröffentlicht in: | Prikladnaya Diskretnaya Matematika 2024 (64), p.72-78 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | eng |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Schreiben Sie den ersten Kommentar!