Complexity Bounds for Sum-Product Logic via Additive Proof Nets and Petri Nets (Q4635793): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q130866213, #quickstatements; #temporary_batch_1733743668271
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Dominic J. D. Hughes / rank
Normal rank
 
Property / author
 
Property / author: Dominic J. D. Hughes / 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.1109/lics.2015.18 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1583145637 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q130866213 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:30, 9 December 2024

scientific article; zbMATH DE number 6863379
Language Label Description Also known as
English
Complexity Bounds for Sum-Product Logic via Additive Proof Nets and Petri Nets
scientific article; zbMATH DE number 6863379

    Statements

    Complexity Bounds for Sum-Product Logic via Additive Proof Nets and Petri Nets (English)
    0 references
    0 references
    0 references
    23 April 2018
    0 references
    search problems
    0 references
    computational complexity
    0 references
    formal logic
    0 references
    game theory
    0 references
    Petri nets
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references