107 search results - page 2 / 22 » New Structure Theorem for Subresultants |
CORR
2011
Springer
12 years 11 months ago
2011
Springer
We propose a new definition of the representation theorem for many-valued logics, with modal operators as well, and define the stronger relationship between algebraic models of ...
AAECC
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Starting with Karr's structural theorem for summation --the discrete version of Liouville's structural theorem for integration-- we work out crucial properties ...
IACR
2011
12 years 7 months ago
2011
We put forward a framework for the modular design and analysis of multi-party protocols. Our framework is called “GNUC” (with the recursive meaning “GNUC’s Not UC”), alr...
COMPGEOM
2011
ACM
12 years 11 months ago
2011
ACM
Forbidden substructure theorems have proved to be among of the most versatile tools in bounding the complexity of geometric objects and the running time of geometric algorithms. T...
BIRTHDAY
1997
Springer
13 years 11 months ago
1997
Springer
Abstract. Logic preservation theorems often have the form of a syntax/semantics correspondence. For example, the Los-Tarski theorem asserts that a rst-order sentence is preserved b...