default search action
"Horn Programming in Linear Logic Is NP-Complete"
Max I. Kanovich (1992)
- Max I. Kanovich:
Horn Programming in Linear Logic Is NP-Complete. LICS 1992: 200-210
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.