test_moissonnage_selune
type: Agent

On paths-based criteria for polynomial time complexity in proof-nets
type: Distribution
access URL: https://hal.science/hal-00992578
format: HTML
issued: 2026-05-05T10:57:37.783222
modified: 2026-05-05T10:57:37.772219

On paths-based criteria for polynomial time complexity in proof-nets
type: Dataset
contact point: Organization
  fn: CCSD
keyword: conference-papers
keyword: context-semantics
keyword: implicit-computational-complexity
keyword: light-logics
keyword: linear-logic
keyword: infoeu-reposemanticsconferenceobject
keyword: polynomial-time
keyword: infoinfo-locomputer-science-cslogic-in-computer-science-cslo
landing page: Foundational and Practical Aspects of Resource Analysis (FOPARA) 2013
description: International audience
issued: 2026-05-05T10:57:37.781016
language: en
modified: 2026-05-05T10:57:37.781021