Complexity bounds for sum-product logic via additive proof nets and Petri nets (Q4635793)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Complexity bounds for sum-product logic via additive proof nets and Petri nets |
scientific article; zbMATH DE number 6863379
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
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
0.7609007358551025
0 references
0.7599645256996155
0 references
0.7574920654296875
0 references
0.7562499642372131
0 references
