Sciweavers

98 search results - page 6 / 20
» Efficient solution of systems of Boolean equations
Sort
View
CSMR
2004
IEEE
15 years 1 months ago
Rewrite Systems for Symbolic Evaluation of C-like Preprocessing
Automatic analysis of programs with preprocessing directives and conditional compilation is challenging. The difficulties range from parsing to program understanding. Symbolic eva...
Mario Latendresse
NA
2006
75views more  NA 2006»
14 years 9 months ago
Least-squares spectral collocation with the overlapping Schwarz method for the incompressible Navier-Stokes equations
A least-squares spectral collocation scheme is combined with the overlapping Schwarz method. The methods are succesfully applied to the incompressible Navier-Stokes equations. The...
Wilhelm Heinrichs
ECCC
2010
99views more  ECCC 2010»
14 years 9 months ago
A Unified Framework for Testing Linear-Invariant Properties
Abstract--There has been a sequence of recent papers devoted to understanding the relation between the testability of properties of Boolean functions and the invariance of the prop...
Arnab Bhattacharyya, Elena Grigorescu, Asaf Shapir...
FOCS
2009
IEEE
15 years 4 months ago
Linear Systems over Composite Moduli
We study solution sets to systems of generalized linear equations of the form ℓi(x1, x2, · · · , xn) ∈ Ai (mod m) where ℓ1, . . . , ℓt are linear forms in n Boolean var...
Arkadev Chattopadhyay, Avi Wigderson
ICNP
2007
IEEE
15 years 3 months ago
Network Court Protocol and Malicious Node Conviction
- A Network Court Protocol is designed for malicious node conviction based on information from network node accusing and testifying operations, which are formally modeled by algebr...
Na Li, David Lee