2877 search results - page 152 / 576 » The Complexity of Planarity Testing |
197
click to vote
TR
2010
14 years 11 months ago
2010
Software testing is an important issue in software engineering. As software systems become increasingly large and complex, the problem of how to optimally allocate the limited test...
131
click to vote
SIGSOFT
2007
ACM
16 years 5 months ago
2007
ACM
Because of the growing complexity of wireless sensor network applications (WSNs), traditional software development tools are being developed that are specifically designed for the...
181
click to vote
IFIP
2001
Springer
15 years 9 months ago
2001
Springer
— Semi-formal verification based on symbolic simulation offers a good compromise between formal model checking and numerical simulation. The generation of functional test vector...
209
click to vote
ECCC
2011
14 years 11 months ago
2011
Polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithmetic circuits. In this work, we study the complexity of two special but natural ...
154
click to vote
STOC
2004
ACM
16 years 4 months ago
2004
ACM
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...