AIPS
2007
13 years 6 months ago
2007
We introduce the Linear Resource Temporal Network (LRTN), which consists of activities that consume or produce a resource, subject to absolute and relative metric temporal constra...
FOCS
1991
IEEE
13 years 7 months ago
1991
IEEE
The upper bound on the exponent, ω, of matrix multiplication over a ring that was three in 1968 has decreased several times and since 1986 it has been 2.376. On the other hand, t...
LICS
1995
IEEE
13 years 7 months ago
1995
IEEE
We prove that tree isomorphism is not expressible in the language (FO + TC + COUNT). This is surprising since in the presence of ordering the language captures NL, whereas tree is...
DAC
1995
ACM
13 years 7 months ago
1995
ACM
Abstract We observe that the switching activity at a circuit node, also called the transition density, can be extremely sensitive to the circuit internal delays. As a result, sligh...
ASIACRYPT
2001
Springer
13 years 8 months ago
2001
Springer
Abstract. We apply autocorrelation and Walsh coefficients for the investigation of correlation immune and resilient Boolean functions. We prove new lower bound for the absolute ind...
DATE
2004
IEEE
13 years 8 months ago
2004
IEEE
We show how to implement an arbitrary two-qubit unitary operation using any of several quantum gate libraries with small a priori upper bounds on gate counts. In analogy to librar...
WCNC
2010
IEEE
13 years 8 months ago
2010
IEEE
Abstract—This paper presents a new upper bound on the endto-end signal-to-noise ratio (SNR) of channel-assisted amplifyand-forward (AF) multi-hop relay networks. The harmonic mea...
ACISP
2009
Springer
13 years 8 months ago
2009
Springer
Abstract. We establish a framework for bounding the efficiency of cryptographic reductions in terms of their security transfer. While efficiency bounds for the reductions have been...
WDAG
1990
Springer
13 years 8 months ago
1990
Springer
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
FPCA
1989
13 years 8 months ago
1989
One way to analyse programs is to to derive expressions for their computational behaviour. A time bound function (or worst-case complexity) gives an upper bound for the computatio...