Bounded linear logic: A modular approach to polynomial-time computability (Q1193854): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q126351278, #quickstatements; #temporary_batch_1723980736387 |
||
| (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.1016/0304-3975(92)90386-t / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1971256104 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q126351278 / rank | |||
Normal rank | |||
Latest revision as of 12:33, 18 August 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bounded linear logic: A modular approach to polynomial-time computability |
scientific article |
Statements
Bounded linear logic: A modular approach to polynomial-time computability (English)
0 references
27 September 1992
0 references
The paper uses a restricted version of linear logic [each use of an exponential connective is bounded from advance] in order to produce complexity specifications. Any functional term of appropriate type encodes a polynomial-time algorithm and -- most intriguing -- any polynomial-time function can be obtained in this way. This is a splendid piece of theory motivated by fairly practical questions.
0 references
restricted version of linear logic
0 references
complexity specifications
0 references
polynomial-time algorithm
0 references
polynomial-time function
0 references
0 references
