1274 search results - page 29 / 255 » New Proofs for |
137
click to vote
AAI
2010
14 years 11 months ago
2010
In this paper, we propose a proof system for reasoning on certain specifications of secure authentication systems. For this purpose, a new logic, sequence-indexed linear-time temp...
145
click to vote
STOC
2003
ACM
15 years 9 months ago
2003
ACM
Given a k-uniform hypergraph, the Ek-Vertex-Cover problem is to find the smallest subset of vertices that intersects every hyperedge. We present a new multilayered PCP constructi...
154
click to vote
COMPGEOM
1996
ACM
15 years 8 months ago
1996
ACM
We show that in the worst case, (ndd=2e;1 +n logn) sidedness queries are required to determine whether the convex hull of n points in IRd is simplicial, or to determine the number ...
143
click to vote
STOC
2006
ACM
16 years 4 months ago
2006
ACM
The width of a resolution proof is the maximal number of literals in any clause of the proof. The space of a proof is the maximal number of clauses kept in memory simultaneously if...
ASIACRYPT
2000
Springer
15 years 8 months ago
2000
Springer
In a recent Stanford Law Review article, Ayres and Bulow [1] propose a radical anonymity-based solution to disrupt the “market” for monetary influence in political campaigns. ...