Sciweavers

4305 search results - page 80 / 861
» The Test of Time
Sort
View
ISSAC
1997
Springer
102views Mathematics» more  ISSAC 1997»
15 years 10 months ago
A Numerical Absolute Primality Test for Bivariate Polynomials
We give a new numerical absolute primality criterion for bivariate polynomials. This test is based on a simple property of the monomials appearing after a generic linear change of...
André Galligo, Stephen M. Watt
CORR
2008
Springer
84views Education» more  CORR 2008»
15 years 6 months ago
Efficiently Testing Sparse GF(2) Polynomials
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 ...
Ilias Diakonikolas, Homin K. Lee, Kevin Matulef, R...
CSR
2008
Springer
15 years 7 months ago
Comparing Universal Covers in Polynomial Time
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...
Jirí Fiala, Daniël Paulusma
ISSRE
2006
IEEE
15 years 12 months ago
Detecting Redundant Unit Tests for AspectJ Programs
Aspect-oriented software development is gaining popularity with the adoption of languages such as AspectJ. Testing is an important part in any software development, including aspe...
Tao Xie, Jianjun Zhao, Darko Marinov, David Notkin
PICS
2003
15 years 7 months ago
Testing the Reciprocity Law in Digital Photography
An experimental and theoretical methodology based on spectroradiometric measures is proposed to test if the reciprocity law is verified in digital photography. Taking into account...
Francisco Martínez-Verdú, Jaume Pujo...