On P Versus NP for Parameter-Free Programs Over Algebraic Structures (Q2707072): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| label / en | label / en | ||
On P Versus NP for Parameter-Free Programs Over Algebraic Structures | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/1521-3870(200101)47:1<67::aid-malq67>3.0.co;2-v / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2017722148 / rank | |||
Normal rank | |||
| Property / title | |||
On P Versus NP for Parameter-Free Programs Over Algebraic Structures (English) | |||
| Property / title: On P Versus NP for Parameter-Free Programs Over Algebraic Structures (English) / rank | |||
Normal rank | |||
Latest revision as of 12:01, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On P Versus NP for Parameter-Free Programs Over Algebraic Structures |
scientific article |
Statements
28 March 2001
0 references
programs over algebraic structures
0 references
complexity classes
0 references
computation model
0 references
time complexity of computations over arbitrary first-order structures
0 references
parameter-free computations
0 references
P versus NP
0 references
quantifier elimination
0 references
computation tree analysis
0 references
structural complexity theory
0 references
On P Versus NP for Parameter-Free Programs Over Algebraic Structures (English)
0 references
