1066 search results - page 42 / 214 » Computing Private Set Operations with Linear Complexities |
CG
2004
Springer
14 years 9 months ago
2004
Springer
This work presents a stratification approach for modeling two-dimensional cell complexes. It introduces the concept of combinatorial stratification and uses the Handlebody theory ...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the se...
TOCL
2011
14 years 4 months ago
2011
In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the s...
IEEEARES
2010
IEEE
15 years 4 months ago
2010
IEEE
- An operational complexity model (OCM) is proposed to enable the complexity of both the cognitive and the computational components of a process to be determined. From the complexi...
AMC
2010
14 years 9 months ago
2010
: Parallel iterative methods are powerful tool for solving large system of linear equations (LEs). The existing parallel computing research results are focussed mainly on sparse sy...