3044 search results - page 16 / 609 » Linear logical approximations |
FCT
2007
Springer
14 years 1 months ago
2007
Springer
We present new combinatorial approximation algorithms for k-set cover. Previous approaches are based on extending the greedy algorithm by efficiently handling small sets. The new a...
AAIM
2007
Springer
14 years 1 months ago
2007
Springer
The disc covering problem asks to cover a set of points on the plane with a minimum number of fix-sized discs. We develop an O(n(log n)2 (log log n)2 ) deterministic time 2.8334-a...
LICS
1996
IEEE
13 years 11 months ago
1996
IEEE
We present the linear type theory LLF as the forThis extended abstract will appear on the proceedings of the Eleventh Annual IEEE Symposium on Logic in Computer Science -LICS'...
JDA
2006
13 years 7 months ago
2006
We prove that the pathwidth of Halin graphs can be 3-approximated in linear time. Our approximation algorithms is based on a combinatorial result about respectful edge orderings o...
TABLEAUX
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. linTAP is a tableau prover for the multiplicative and exponential fragment M?LL of Girards linear logic. It proves the validity of a given formula by constructing an anal...