Bounded linear logic: A modular approach to polynomial-time computability (Q1193854): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Computational interpretations of linear logic / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3800030 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4133141 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4035304 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4035305 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4769050 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The structure of multiplicatives / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5625124 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Linear logic / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3819066 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Π12-logic, Part 1: Dilators / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3824307 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4204146 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3203017 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3994895 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bounded linear logic: A modular approach to polynomial-time computability / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3758820 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Relational queries computable in polynomial time / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Opérateurs de mise en mémoire et traduction de Gödel. (Storage operators and Gödel translation) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3204445 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3325707 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4712651 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3698786 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3707407 / rank | |||
Normal rank |
Revision as of 13:25, 16 May 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