107 search results - page 7 / 22 » New Structure Theorem for Subresultants |
LACL
2001
Springer
15 years 4 months ago
2001
Springer
Lambek [13] introduces pregroups as a new framework for syntactic structure. In this paper we prove some new theorems on pregroups and study grammars based on the calculus of free...
ICITS
2009
14 years 9 months ago
2009
Abstract. The term indistinguishability amplification refers to a setting where a certain construction combines two (or more) cryptographic primitives of the same type to improve t...
109
click to vote
LPAR
2010
Springer
14 years 9 months ago
2010
Springer
By Courcelle's Theorem we know that any property of finite structures definable in monadic second-order logic (MSO) becomes tractable over structures with bounded treewidth. T...
ICRA
2005
IEEE
15 years 5 months ago
2005
IEEE
– This paper describes a new algorithm for the efficient mass-matrix inversion of serial manipulators. Whereas several well-known O(n) algorithms already exist, our presentation ...
104
click to vote
PODS
2007
ACM
15 years 12 months ago
2007
ACM
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...