2168 search results - page 77 / 434 » Randomized Algorithms and Complexity Theory |
113
click to vote
SPAA
2003
ACM
15 years 8 months ago
2003
ACM
The general problem of verifying coherence for shared-memory multiprocessor executions is NP-Complete. Verifying memory consistency models is therefore NP-Hard, because memory con...
153
click to vote
FM
2009
Springer
15 years 9 months ago
2009
Springer
Abstract: There is growing need to develop formal verification tools for Message Passing Interface (MPI) programs, to eliminate bugs such as deadlocks and local assertion violatio...
135
click to vote
STOC
2009
ACM
16 years 3 months ago
2009
ACM
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
122
click to vote
ICASSP
2009
IEEE
15 years 9 months ago
2009
IEEE
We provide a review of independent component analysis (ICA) for complex-valued improper and noncircular random sources. An improper random signal is correlated with its complex co...
143
click to vote
SIAMCOMP
2008
15 years 3 months ago
2008
Leslie Valiant recently proposed a theory of holographic algorithms. These novel algorithms achieve exponential speed-ups for certain computational problems compared to naive algo...