352 search results - page 47 / 71 » Proofs as Polynomials |
CAV
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We address the issue of efficiently automating assume-guarantee reasoning for simulation conformance between finite state systems and specifications. We focus on a non...
82
Voted
WINE
2005
Springer
15 years 3 months ago
2005
Springer
We consider the following allocation problem arising in the setting of combinatorial auctions: a set of goods is to be allocated to a set of players so as to maximize the sum of t...
89
Voted
ISAAC
2004
Springer
15 years 3 months ago
2004
Springer
We propose a model of computation where a Turing machine is given random access to an advice string. With random access, an advice string of exponential length becomes meaningful ...
TCC
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Until recently, the existence of collection of trapdoor permutations (TDP) was believed (and claimed) to imply almost all of the major cryptographic primitives, including...
FOCS
2003
IEEE
15 years 3 months ago
2003
IEEE
We give a surprisingly short proof that in any planar arrangement of Ò curves where each pair intersects at most a fixed number (×) of times, the -level has subquadratic (Ç´...