"On semantic and type-theoretic aspects of polynomial-time computability."

Andrzej S. Murawski (2001)

Details and statistics

DOI:

access: closed

type: Book or Thesis

metadata version: 2022-04-05

a service of  Schloss Dagstuhl - Leibniz Center for Informatics