Pages that link to "Item:Q1342254"

The following pages link to Constant-only multiplicative linear logic is NP-complete (Q1342254):

Displayed 4 items.

• First-order linear logic without modalities is NEXPTIME-hard (Q1342252) ‎ (← links)
• System BV is NP-complete (Q2478549) ‎ (← links)
• ! and ? – Storage as tensorial strength (Q4715669) ‎ (← links)
• Parsing MELL proof nets (Q5940925) ‎ (← links)