29908 search results - page 248 / 5982 » On the complexity of communication complexity |
172
click to vote
COCO
1998
Springer
15 years 11 months ago
1998
Springer
We use the powerful tools of counting complexity and generic oracles to help understand the limitations of the complexity of quantum computation. We show several results for the p...
173
click to vote
ICALP
1998
Springer
15 years 10 months ago
1998
Springer
The complexity of LTrL, a global linear time temporal logic over traces is investigated. The logic is global because the truth of a formula is evaluated in a global state, also ca...
173
click to vote
LATIN
1998
Springer
15 years 10 months ago
1998
Springer
The reconstruction of a shape or surface from a finite set of points is a practically significant and theoretically challenging problem. This paper presents a unified view of algor...
164
click to vote
ICECCS
1997
IEEE
15 years 10 months ago
1997
IEEE
An approach to problem analysis is described, based on the notion of a problem frame. Problem frames are intended to capture classes of recognisable and soluble problems. Because ...
175
click to vote
LFCS
1997
Springer
15 years 10 months ago
1997
Springer
The provability problem for the Horn fragment of linear logic is NP-complete [4, 1]. In this work we investigate various definitions of concurrency proposed in [2] and establish t...