Pages that link to "Item:Q1648864"
From MaRDI portal
The following pages link to Direct encodings of NP-complete problems into Horn sequents of multiplicative linear logic (Q1648864):
Displaying 4 items.
- Constant-only multiplicative linear logic is NP-complete (Q1342254) (← links)
- A formal model for a linear time correctness condition of proof nets of multiplicative linear logic (Q2119124) (← links)
- System BV is NP-complete (Q2478549) (← links)
- On Hardness of Multilinearization and VNP-Completeness in Characteristic 2 (Q4973864) (← links)