3238 search results - page 297 / 648 » On the Computational Interpretation of Negation |
194
click to vote
FOCS
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper is concerned with the complexity of proofs and of searching for proofs in two propositional proof systems: Resolution and Polynomial Calculus (PC). For the former syste...
173
click to vote
ICNP
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper introduces concast, a new network service. Concast is the inverse of multicast: multiple sources send messages toward the same destination, which results in a single me...
170
Voted
STACS
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
161
click to vote
RTA
1998
Springer
15 years 11 months ago
1998
Springer
There is a close relationship between word unification and second-order unification. This similarity has been exploited for instance for proving decidability of monadic second-orde...
283
click to vote
ICNP
1996
IEEE
15 years 11 months ago
1996
IEEE
We analyze the maximum throughput that the known classes of reliable multicast protocols can attain. A new taxonomy of reliable multicast protocols is introduced based on the prem...