59 search results - page 9 / 12 » A Pushing-Pulling Method: New Proofs of Intersection Theorem... |
JSYML
2010
13 years 2 months ago
2010
A set A of vertices of a graph G is called d-scattered in G if no two d-neighborhoods of (distinct) vertices of A intersect. In other words, A is d-scattered if no two distinct ver...
Publication
In this note we aim to give a new, elementary proof of a statement that was first proved by Timofte (2003) [15]. It says that a symmetric real polynomial F of degree d in n variabl...
FQAS
2006
Springer
13 years 11 months ago
2006
Springer
Consistent query answering is the term commonly used for the problem of answering queries on databases that violate certain integrity constraints. We address this problem for univ...
IFM
2004
Springer
14 years 1 months ago
2004
Springer
Recent work on combining CSP and B has provided ways of describing systems comprised of components described in both B (to express requirements on state) and CSP (to express intera...
ASIAN
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. This paper is concerned about relating formal and computational models of cryptography in case of active adversaries when formal security analysis is done with first ord...