1507 search results - page 40 / 302 » Separating Complexity Classes Using Structural Properties |
CIE
2008
Springer
13 years 12 months ago
2008
Springer
There are many ways to define complexity in logic. In finite model theory, it is the complexity of describing properties, whereas in proof complexity it is the complexity of provin...
WADS
2007
Springer
14 years 4 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
BMCBI
2010
13 years 10 months ago
2010
Background: With the rapid development of new genetic measurement methods, several types of genetic alterations can be quantified in a high-throughput manner. While the initial fo...
CODES
2005
IEEE
14 years 3 months ago
2005
IEEE
The growing number of information security breaches in electronic and computing systems calls for new design paradigms that consider security as a primary design objective. This i...
ICC
2000
IEEE
14 years 2 months ago
2000
IEEE
—A new and efficient class of nonlinear equalizers is developed for intersymbol interference (ISI) channels. These “iterated-decision equalizers” use an optimized multipass a...