256 search results - page 13 / 52 » Separation of NP-Completeness Notions |
DAC
1995
ACM
15 years 1 months ago
1995
ACM
Abstract— Many asynchronous designs are naturally specified and implemented hierarchically as an interconnection of separate asynchronous modules that operate concurrently and c...
COMBINATORICS
2007
14 years 9 months ago
2007
We investigate the notion of quantum chromatic number of a graph, which is the minimal number of colours necessary in a protocol in which two separated provers can convince a refe...
SIGSOFT
2010
ACM
14 years 7 months ago
2010
ACM
Concurrent program verification is challenging because it involves exploring a large number of possible thread interleavings together with complex sequential reasoning. As a resul...
POPL
2010
ACM
15 years 6 months ago
2010
ACM
Most systems based on separation logic consider only restricted forms of implication or non-separating conjunction, as full support for these connectives requires a non-trivial no...
IWCIA
2004
Springer
15 years 2 months ago
2004
Springer
In this paper we propose several equivalent definitions of digital curves and hypersurfaces in arbitrary dimension. The definitions involve properties such as one-dimensionality ...