29908 search results - page 358 / 5982 » On the complexity of communication complexity |
154
click to vote
STOC
1996
ACM
15 years 11 months ago
1996
ACM
We study the complexity of computing Boolean functions using AND, OR and NOT gates. We show that a circuit of depth d with S gates can be made to output a constant by setting O(S1...
131
click to vote
ICRA
1993
IEEE
15 years 11 months ago
1993
IEEE
In this paper we introduce a formalism which combines reliability and complexity as performance measures for Intelligent Machines. For a given desired reliability, di erent algori...
164
click to vote
FOCS
1990
IEEE
15 years 10 months ago
1990
IEEE
The exponent of periodicity is an important factor in estimates of complexity of word-unification algorithms. We prove that the exponent of periodicity of a minimal solution of a w...
202
click to vote
KR
2010
Springer
15 years 10 months ago
2010
Springer
We investigate the computational complexity of axiom pinpointing, which is the task of finding minimal subsets of a Description Logic knowledge base that have a given consequence...
159
click to vote
COCO
2009
Springer
15 years 10 months ago
2009
Springer
Every Boolean function on n variables can be expressed as a unique multivariate polynomial modulo p for every prime p. In this work, we study how the degree of a function in one c...