281 search results - page 45 / 57 » The Proof Complexity of Linear Algebra |
TCC
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Parallel repetition is well known to reduce the error probability at an exponential rate for single- and multi-prover interactive proofs. Bellare, Impagliazzo and Naor (1...
COMPGEOM
2006
ACM
14 years 1 months ago
2006
ACM
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (tj) and radii (rj) that cover a given set of...
TIT
1998
13 years 7 months ago
1998
—We use recent network calculus results to study some properties of lossless multiplexing as it may be used in guaranteed service networks. We call network calculus a set of resu...
VLSID
2002
IEEE
14 years 8 months ago
2002
IEEE
This paper introduces a new numerical approximation technique, called the Differential Quadrature Method (DQM), in order to derive the rational ABCD matrix representing the high-s...
DCC
2006
IEEE
14 years 7 months ago
2006
IEEE
So far there is no systematic attempt to construct Boolean functions with maximum annihilator immunity. In this paper we present a construction keeping in mind the basic theory of...