2877 search results - page 46 / 576 » The Complexity of Planarity Testing |
STOC
2005
ACM
14 years 9 months ago
2005
ACM
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
: Given two testable properties P1 and P2, under what conditions are the union, intersection or set-difference of these two properties also testable? We initiate a systematic study...
AAECC
2002
Springer
13 years 9 months ago
2002
Springer
It is shown that a q-periodic sequence over the finite field Fq passes an extended version of Marsaglia's lattice test for high dimensions if and only if its linear complexity...
DATE
2008
IEEE
14 years 3 months ago
2008
IEEE
Existing work on testing NoC-based systems advocates to reuse the on-chip network itself as test access mechanism (TAM) to transport test data to/from embedded cores. While this m...
ESEM
2007
ACM
14 years 27 days ago
2007
ACM
It is important for test managers to be able to estimate the effort required to execute the test suites requested by development teams, as well to estimate its capacity for attend...