11016 search results - page 714 / 2204 » Cloud Computing for Science |
248
click to vote
WMP
2000
15 years 11 months ago
2000
This paper is an attempt to summarize the basic elements of the multiset theory. We begin by describing multisets and the operations between them, then we present hybrid sets and t...
175
click to vote
FOCS
1995
IEEE
15 years 11 months ago
1995
IEEE
We consider the special case of the traveling salesman problem TSP in which the distance metric is the shortest-path metric of a planar unweighted graph. We present a polynomial...
215
click to vote
HOA
1995
15 years 11 months ago
1995
We show that it is decidable whether a third-order matching problem in the polymorphic lambda calculus has a solution. The proof is constructive in the sense that an algorithm can...
163
click to vote
FOCS
1991
IEEE
15 years 11 months ago
1991
IEEE
Karchmer, Raz, and Wigderson, 1991, discuss the circuit depth complexity of n bit Boolean functions constructed by composing up to d = logn=loglogn levels of k = logn bit boolean
182
click to vote
CAAP
1990
15 years 11 months ago
1990
The chief purpose of this paper is to appraise the feasibility of Girard’s linear logic as a specification language for parallel processes. To this end we propose an interpreta...