2877 search results - page 28 / 576 » The Complexity of Planarity Testing |
STACS
2009
Springer
14 years 3 months ago
2009
Springer
Motivated by the quantum algorithm for testing commutativity of black-box groups (Magniez and Nayak, 2007), we study the following problem: Given a black-box finite ring by an add...
ETS
2006
IEEE
14 years 3 months ago
2006
IEEE
In this paper, complex mixed signal circuits such as SiP or SOC including several ADCs and DACs are considered. A new DFT technique is proposed allowing the test of this complete ...
OSDI
2008
ACM
14 years 9 months ago
2008
ACM
We present a new symbolic execution tool, KLEE, capable of automatically generating tests that achieve high coverage on a diverse set of complex and environmentally-intensive prog...
MFCS
1993
Springer
14 years 1 months ago
1993
Springer
We prove (for fixed k) that at least 1 k−1 (n 2 ) − O(n) equality tests and no more than 2 k (n 2 )+O(n) equality tests are needed in the worst case to determine whether a giv...
COGSCI
2008
13 years 8 months ago
2008
This article investigates the potential of fMRI to test assumptions about different components in models of complex cognitive tasks. If the components of a model can be associated...