A semantic proof of polytime soundness of light affine logic
From MaRDI portal
Publication:987375
DOI10.1007/s00224-009-9210-xzbMath1205.68169MaRDI QIDQ987375
Publication date: 13 August 2010
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-009-9210-x
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)