Polynomial upper bounds on the size of changes of a RAM+BOOL program as a tool for proving belonging to FP (Q2253865): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10958-014-1831-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2031557554 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4091421 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3589273 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4942157 / rank | |||
Normal rank | |||
Latest revision as of 16:21, 9 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial upper bounds on the size of changes of a RAM+BOOL program as a tool for proving belonging to FP |
scientific article |
Statements
Polynomial upper bounds on the size of changes of a RAM+BOOL program as a tool for proving belonging to FP (English)
0 references
13 February 2015
0 references
Turing machine
0 references
function-oracle Turing machine
0 references
class FP
0 references
