13306 search results - page 343 / 2662 » Theoretical Computer Science |
138
click to vote
WG
2000
Springer
15 years 10 months ago
2000
Springer
Several practical instances of network design and location theory problems require the network to satisfy multiple constraints. In this paper, we address graph-theoretic problems t...
164
click to vote
FOCS
1995
IEEE
15 years 10 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...
188
click to vote
HOA
1995
15 years 10 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...
148
click to vote
FOCS
1991
IEEE
15 years 10 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
167
click to vote
CAAP
1990
15 years 10 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...