486 search results - page 33 / 98 » Improved upper bounds for 3-SAT |
ECCC
2010
13 years 7 months ago
2010
We study the problem of testing isomorphism (equivalence up to relabelling of the variables) of two Boolean functions f, g : {0, 1}n → {0, 1}. Our main focus is on the most stud...
CADE
2006
Springer
14 years 7 days ago
2006
Springer
We introduce a Presburger modal logic PML with regularity constraints and full Presburger constraints on the number of children that generalize graded modalities, also known as num...
ACL
1990
13 years 9 months ago
1990
In the literature, Tree Adjoining Grammars (TAGs) are propagated to be adequate for natural language description -- analysis as well as generation. In this paper we concentrate on...
JSAC
1998
13 years 8 months ago
1998
—The performance and design of turbo codes using coherent BPSK signaling on the Rayleigh fading channel is considered. In low signal-to-noise regions, performance analysis uses s...
SAC
2002
ACM
13 years 8 months ago
2002
ACM
Iterative solvers such as the Jacobi and Gauss-Seidel relaxation methods are important, but time-consuming building blocks of many scientific and engineering applications. The per...