Sciweavers

322 search results - page 4 / 65
» Satisfiability Coding Lemma
Sort
View
EUROCRYPT
1991
Springer
13 years 11 months ago
Boolean Functions Satisfying Higher Order Propagation Criteria
Boolean functions that satisfy higher order propagation criteria are studied. A complete characterization is given of the autocorrelation function and Walsh spectrum of second ord...
Bart Preneel, René Govaerts, Joos Vandewall...
CODES
2005
IEEE
14 years 1 months ago
Satisfying real-time constraints with custom instructions
Instruction-set extensible processors allow an existing processor core to be extended with application-specific custom instructions. In this paper, we explore a novel application...
Pan Yu, Tulika Mitra
COCO
2008
Springer
88views Algorithms» more  COCO 2008»
13 years 9 months ago
Approximation of Natural W[P]-Complete Minimisation Problems Is Hard
We prove that the weighted monotone circuit satisfiability problem has no fixed-parameter tractable approximation algorithm with constant or polylogarithmic approximation ratio un...
Kord Eickmeyer, Martin Grohe, Magdalena Grübe...
RSA
2006
74views more  RSA 2006»
13 years 7 months ago
Robust locally testable codes and products of codes
We continue the investigation of locally testable codes, i.e., error-correcting codes for whom membership of a given word in the code can be tested probabilistically by examining ...
Eli Ben-Sasson, Madhu Sudan
FMCO
2009
Springer
120views Formal Methods» more  FMCO 2009»
13 years 5 months ago
A Framework for Reasoning on Component Composition
The main characteristics of component models is their strict structure enabling better code reuse. Correctness of component composition is well understood formally but existing wor...
Ludovic Henrio, Florian Kammüller, Muhammad U...