Sciweavers

4488 search results - page 109 / 898
» Properties of NP-Complete Sets
Sort
View
ECCC
2011
187views ECommerce» more  ECCC 2011»
12 years 11 months ago
In Brute-Force Search of Correlation Bounds for Polynomials
We report on some initial results of a brute-force search for determining the maximum correlation between degree-d polynomials modulo p and the n-bit mod q function. For various s...
Frederic Green, Daniel Kreymer, Emanuele Viola
CDC
2010
IEEE
137views Control Systems» more  CDC 2010»
12 years 11 months ago
On the uniform input-to-state stability of reaction-diffusion systems
Abstract— In the present paper we consider uniform inputto-state stability of reaction-diffusion equations and compare it with its finite dimensional counterpart without diffusi...
Sergey Dashkovskiy, Andrii Mironchenko
APLAS
2010
ACM
13 years 5 months ago
Metric Spaces and Termination Analyses
We present a framework for defining abstract interpreters for liveness properties, in particular program termination. The framework makes use of the theory of metric spaces to defi...
Aziem Chawdhary, Hongseok Yang
ESORICS
2005
Springer
14 years 1 months ago
Enforcing Non-safety Security Policies with Program Monitors
We consider the enforcement powers of program monitors, which intercept security-sensitive actions of a target application at run time and take remedial steps whenever the target a...
Jay Ligatti, Lujo Bauer, David Walker
SIAMCOMP
1998
102views more  SIAMCOMP 1998»
13 years 7 months ago
L-Printable Sets
A language is L-printable if there is a logspace algorithm which, on input 1n, prints all members in the language of length n. Following the work of Allender and Rubinstein [SIAM J...
Lance Fortnow, Judy Goldsmith, Matthew A. Levy, St...