Product-free Lambek calculus is NP-complete (Q408532): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.apal.2011.09.017 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 03B47 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 03B25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6022765 / rank
 
Normal rank
Property / zbMATH Keywords
 
Lambek calculus
Property / zbMATH Keywords: Lambek calculus / rank
 
Normal rank
Property / zbMATH Keywords
 
algorithmic complexity
Property / zbMATH Keywords: algorithmic complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
proof nets
Property / zbMATH Keywords: proof nets / rank
 
Normal rank
Property / zbMATH Keywords
 
derivability
Property / zbMATH Keywords: derivability / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.apal.2011.09.017 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4206777114 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non‐associative Lambek Categorial Grammar in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263011 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Mathematics of Sentence Structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lambek calculus is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lambek Grammars with One Division Are Decidable in Polynomial Time / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.APAL.2011.09.017 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:42, 9 December 2024

scientific article
Language Label Description Also known as
English
Product-free Lambek calculus is NP-complete
scientific article

    Statements

    Product-free Lambek calculus is NP-complete (English)
    0 references
    0 references
    10 April 2012
    0 references
    Lambek calculus
    0 references
    algorithmic complexity
    0 references
    proof nets
    0 references
    derivability
    0 references

    Identifiers