793 search results - page 20 / 159 » Argumentation and standards of proof |
FSTTCS
2009
Springer
14 years 2 months ago
2009
Springer
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
JSC
2008
13 years 7 months ago
2008
In this paper we study standard bases for submodules of K[[t1, . . . , tm]][x1, . . . , xn]s respectively of their localisation with respect to a t-local monomial ordering. The mai...
ASIACRYPT
2009
Springer
14 years 2 months ago
2009
Springer
Group encryption (GE) schemes, introduced at Asiacrypt’07, are an encryption analogue of group signatures with a number of interesting applications. They allow a sender to encryp...
FOCS
2003
IEEE
14 years 21 days ago
2003
IEEE
We show new lower bounds and impossibility results for general (possibly non-black-box) zero-knowledge proofs and arguments. Our main results are that, under reasonable complexity...
RELMICS
1997
Springer
13 years 11 months ago
1997
Springer
In this paper we extend an earlierapproach to graphicalrelationcalculitowards relational matching, thus allowing proofs with fewer auxiliary steps and concentrating more on the es...