29908 search results - page 305 / 5982 » On the complexity of communication complexity |
137
Voted
CSL
2000
Springer
15 years 11 months ago
2000
Springer
We study definability of languages in arithmetic and the free monoid by bounded versions of fixed-point and transitive-closure logics. In particular we give logical characterisat...
181
click to vote
ECAI
1998
Springer
15 years 11 months ago
1998
Springer
Abstract. Default logic is one of the most widely used formalisms to formalize commonsense reasoning. In this paper we analyze the complexity of deciding whether a propositional in...
135
click to vote
EURODAC
1994
IEEE
15 years 10 months ago
1994
IEEE
This paper introduces a new Generalized Signal Transition Graph model for specifying complex mixed asynchronous/synchronouscircuits, as found in system-level interfaces. Our goal h...
192
click to vote
ICCAD
1992
IEEE
15 years 10 months ago
1992
IEEE
In this paper we describe combining a mesh analysis equation formulation technique with a preconditioned GORES matrix solution algorithm to accelerate the determination of inducta...
144
click to vote
COCO
1989
Springer
15 years 10 months ago
1989
Springer
For a monoid G, the iterated multiplication problem is the computation of the product of n elements from G. By re ning known completeness arguments, we show that as G varies over ...