10271 search results - page 627 / 2055 » Computer Science |
167
click to vote
FSTTCS
2009
Springer
16 years 1 months ago
2009
Springer
The covering and boundedness problems for branching vector addition systems are shown complete for doubly-exponential time.
158
click to vote
FSTTCS
2009
Springer
16 years 1 months ago
2009
Springer
ABSTRACT. We present a simple exact algorithm for the INDEPENDENT SET problem with a run
183
click to vote
LICS
2008
IEEE
16 years 1 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...
143
click to vote
LICS
2006
IEEE
16 years 1 months ago
2006
IEEE
U. Berger, [11] significantly simplified Tait’s normalisation proof for bar recursion [27], see
147
click to vote
MFCS
2005
Springer
16 years 24 days ago
2005
Springer
We propose a method to approximate a polygonal object by a deformable smooth surface, namely the t-skin defined by Edelsbrunner [5]