Sciweavers

8689 search results - page 17 / 1738
» Software: hard data
Sort
View
CC
2002
Springer
126views System Software» more  CC 2002»
13 years 8 months ago
On the hardness of approximating the permanent of structured matrices
We show that for several natural classes of "structured" matrices, including symmetric, circulant, Hankel and Toeplitz matrices, approximating the permanent modulo a prim...
Bruno Codenotti, Igor Shparlinski, Arne Winterhof
IJOE
2008
98views more  IJOE 2008»
13 years 8 months ago
OpenLabs Security Laboratory - The Online Security Experiment Platform
For experiments to be reproducible, it is important to have a known and controlled environment. This requires isolation from the surroundings. For security experiments, e.g. with h...
Johan Zackrisson, Charlie Svahnberg
FSTTCS
2006
Springer
14 years 8 days ago
One-Input-Face MPCVP Is Hard for L, But in LogDCFL
A monotone planar circuit (MPC) is a Boolean circuit that can be embedded in a plane, and that has only AND and OR gates. Yang showed that the one-input-face monotone planar circui...
Tanmoy Chakraborty, Samir Datta
KBSE
2007
IEEE
14 years 2 months ago
An automated approach to monitoring and diagnosing requirements
Monitoring the satisfaction of software requirements and diagnosing what went wrong in case of failure is a hard problem that has received little attention in the Software and Req...
Yiqiao Wang, Sheila A. McIlraith, Yijun Yu, John M...
PTS
2010
175views Hardware» more  PTS 2010»
13 years 6 months ago
Test Data Generation for Programs with Quantified First-Order Logic Specifications
We present a novel algorithm for test data generation that is based on techniques used in formal software verification. Prominent examples of such formal techniques are symbolic ex...
Christoph Gladisch