Výsledky vyhledávání - "Lambda calculus complexity enumeration expected complexity"

On counting untyped lambda terms

Autoři: Lescanne, Pierre

Přispěvatelé: Lescanne, Pierre

Zdroj: Theoretical Computer Science. 474:80-97

Témata: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], Discrete Mathematics (cs.DM), Enumeration, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], Complexity, 0102 computer and information sciences, Expected complexity, 16. Peace & justice, 01 natural sciences, Theoretical Computer Science, Logic in Computer Science (cs.LO), [MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO], [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Lambda calculus complexity enumeration expected complexity, 0101 mathematics, Computer Science(all), Computer Science - Discrete Mathematics

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/1107.1327
https://dblp.uni-trier.de/db/journals/corr/corr1107.html#abs-1107-1327
http://www.sciencedirect.com/science/article/pii/S0304397512010493
https://www.sciencedirect.com/science/article/pii/S0304397512010493#!
https://arxiv.org/abs/1107.1327
https://www.sciencedirect.com/science/article/pii/S0304397512010493
https://dblp.uni-trier.de/db/journals/tcs/tcs474.html#Lescanne13