3384 search results - page 3 / 677 » More Testable Properties |
APPROX
2005
Springer
13 years 11 months ago
2005
Springer
There has been significant interest lately in the task of constructing codes that are testable with a small number of random probes. Ben-Sasson and Sudan show that the repeated te...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
: We initiate the study of property testing of submodularity on the boolean hypercube. Submodular functions come up in a variety of applications in combinatorial optimization. For ...
APPROX
2008
Springer
13 years 7 months ago
2008
Springer
: We continue the study of robustly testable tensor codes and expand the class of base codes that can be used as a starting point for the construction of locally testable codes via...
KBSE
2002
IEEE
13 years 10 months ago
2002
IEEE
Finite-state machine (FSM) models are commonly used to represent software with concurrent processes. Established model checking tools can be used to automatically test FSM models,...
COCO
2007
Springer
13 years 11 months ago
2007
Springer
We study a model of graph related formulae that we call the Constraint-Graph model. A constraintgraph is a labeled multi-graph (a graph where loops and parallel edges are allowed)...