Soft Linear Logic and Polynomial Complexity Classes (Q2866738): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logical account of pspace / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Soft Type Assignment System for λ-Calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: A call-by-name lambda-calculus machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Soft linear logic and polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474861 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4457461 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationships between nondeterministic and deterministic tape complexities / rank
 
Normal rank

Latest revision as of 04:38, 7 July 2024

scientific article
Language Label Description Also known as
English
Soft Linear Logic and Polynomial Complexity Classes
scientific article

    Statements

    Soft Linear Logic and Polynomial Complexity Classes (English)
    0 references
    0 references
    0 references
    13 December 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    implicit computational complexity
    0 references
    linear logic
    0 references
    polynomial space
    0 references
    type assignment
    0 references
    0 references