Titlebook: Mathematical Foundations of Computer Science 2006; 31st International S Rastislav Královič,Paweł Urzyczyn Conference proceedings 2006 Sprin

交响乐

LEER

Arthritis

最高点

花束

A Polynomial Time Nilpotence Test for Galois Groups and Related Resultsg time is polynomial in size(.). Also, we generalize the Landau-Miller solvability test to an algorithm that tests if Gal(.) is in Γ.: this algorithm runs in time polynomial in size(.) and .. and, moreover, if Gal(.) ∈ Γ. it computes all the prime factors of # Gal(.).

向外供接触

https://doi.org/10.1007/11821069Automat; algorithm; algorithms; artificial intelligence; automata; bioinformatics; complexity; computer sci

Etching

Communicate

ABYSS

0302-9743 Overview: 978-3-540-37791-7978-3-540-37793-1Series ISSN 0302-9743 Series E-ISSN 1611-3349

无法取消

A Core Calculus for Scala Type CheckingWe present a minimal core calculus that captures interesting constructs of the Scala programming language: nested classes, abstract types, mixin composition, and path dependent types. We show that the problems of type assignment and subtyping in this calculus are decidable.