Complexity Bounds for Sum-Product Logic via Additive Proof Nets and Petri Nets (Q4635793)
From MaRDI portal
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
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
