Bounded linear logic: A modular approach to polynomial-time computability (Q1193854): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Andrej Scedrov / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Philip J. Scott / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Cristian S. Calude / rank | |||
Normal rank | |||
Revision as of 14:48, 11 February 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
