"'Completeness' and 'Full Parallelism' of Parallel Logic Programming Schemes."

Laxmikant V. Kalé (1987)

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2013-12-04

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.