2877 search results - page 27 / 576 » The Complexity of Planarity Testing |
VLSID
2007
IEEE
14 years 9 months ago
2007
IEEE
? We give a new recursive rounding linear programming (LP) solution to the problem of N-detect test minimzation. This is a polynomialtime solution that closely approximates the exa...
ISSRE
2005
IEEE
14 years 2 months ago
2005
IEEE
Code prioritization for testing promises to achieve the maximum testing coverage with the least cost. This paper presents an innovative method to provide hints on which part of co...
ICALP
2005
Springer
14 years 2 months ago
2005
Springer
We consider the problem of testing the commutativity of a black-box group specified by its k generators. The complexity (in terms of k) of this problem was first considered by Pa...
COCOA
2011
Springer
12 years 8 months ago
2011
Springer
The work in this paper is to initiate a theory of testing monomials in multivariate polynomials. The central question is to ask whether a polynomial represented by certain economi...
ICCD
2006
IEEE
14 years 3 months ago
2006
IEEE
—This paper introduces a new class of sequential circuits called acyclically testable sequential circuits which is wider than the class of acyclic sequential circuits but whose t...