36 search results - page 2 / 8 » lics 2008 |
LICS
2008
IEEE
13 years 11 months ago
2008
IEEE
We revisit the correctness criterion for the multiplicative additive fragment of linear logic. We prove that deciding the correctness of corresponding proof structures is NLcomple...
IPL
2007
13 years 4 months ago
2007
The longest increasing circular subsequence (LICS) of a list is considered. A Monte-Carlo algorithm to compute it is given which has worst case execution time O(n3/2 log n) and st...
LICS
2008
IEEE
13 years 11 months ago
2008
IEEE
We show that reachability and termination for lossy channel systems is exactly at level Fωω in the Fast-Growing Hierarchy of recursive functions, the first level that dominates...
LICS
2008
IEEE
13 years 11 months ago
2008
IEEE
Using appropriate notation systems for proofs, cutreduction can often be rendered feasible on these notations. Explicit bounds can be given. Developing a suitable notation system ...
LICS
2008
IEEE
13 years 11 months ago
2008
IEEE
— This paper presents a decidable characterization of tree languages that can be defined by a boolean combination of Σ1 formulas. This is a tree extension of the Simon theorem,...