10715 search results - page 202 / 2143 » Proofs from Tests |
112
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
We give the first algorithm that is both query-efficient and time-efficient for testing whether an unknown function f : {0, 1}n {-1, 1} is an s-sparse GF(2) polynomial versus -far ...
100
click to vote
MOC
2000
15 years 28 days ago
2000
The purpose of this paper is to describe a method to determine whether a bivariate polynomial with rational coefficients is irreducible when regarded as an element in Q((x))[y], th...
114
click to vote
STOC
2009
ACM
16 years 1 months ago
2009
ACM
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
DAC
2000
ACM
16 years 2 months ago
2000
ACM
The use of deep submicron process technologies presents several new challenges in the area of manufacturing test. While a significant body of work has been devoted to identifying ...
ATS
2005
IEEE
15 years 6 months ago
2005
IEEE
We define a new type of test, called “concurrent test,” for a combinational circuit. Given a set of target faults, a concurrent-test is an input vector that detects all (or m...