16666 search results - page 84 / 3334 » Descriptive and Computational Complexity |
126
Voted
FSTTCS
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. This paper studies a recently developed an approach to reasoning about mutable data structures, which uses an assertion language with spatial conjunction and implication ...
109
Voted
APL
1998
ACM
15 years 8 months ago
1998
ACM
This article describes how array predicates were used to reduce the computational complexity of four APL primitive functions when one of their arguments is a permutation vector. T...
135
Voted
LATIN
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. We study the computational complexity of deciding the existence of a Hamiltonian Cycle in some dense classes of k-uniform hypergraphs. Those problems turned out to be, al...
147
click to vote
AHS
2007
IEEE
15 years 3 months ago
2007
IEEE
This paper introduces Perplexus, a European project that aims to develop a scalable hardware platform made of custom reconfigurable devices endowed with bio-inspired capabilities...
110
click to vote
LICS
2009
IEEE
15 years 10 months ago
2009
IEEE
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...