On the complexity of alpha conversion

DOI10.2178/JSL/1203350781zbMath1130.03011OpenAlexW2042441963MaRDI QIDQ5444695

Richard Statman

Publication date: 25 February 2008

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.jsl/1203350781

zbMATH Keywords

alpha convertible combinators

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Complexity of computation (including implicit computational complexity) (03D15) Combinatory logic and lambda calculus (03B40)

Cites Work

• Incidence matrices and interval graphs
• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph

This page was built for publication: On the complexity of alpha conversion