Gap theorem

In computational complexity theory the Gap Theorem, also known as the Borodin-Trakhtenbrot Gap Theorem, is a major theorem about the complexity of… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
The segmentation gene network in Drosophila embryo solves the fundamental problem of embryonic patterning: how to establish a… (More)
Is this relevant?
2010
2010
It may be shown that dm may only equal [a] or [a] + 1 (that is, 0 or 1 when 0 < a < 1) . If we replace [a] by s (small) and [a… (More)
Is this relevant?
2008
2008
The classical Three Gap Theorem asserts that for n ∈ N and p ∈ R, there are at most three distinct distances between consecutive… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2007
Highly Cited
2007
In this paper, we present a novel no-reference (NR) method to assess the quality of JPEG-coded images using a sequential learning… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
This work presents a simple sequential growing and pruning algorithm for radial basis function (RBF) networks. The algorithm… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
  • table II
Is this relevant?
1998
1998
We show that all sets that are complete for NP under non-uniform AC0 reductions are isomorphic under non-uniform AC0-computable… (More)
Is this relevant?
1994
1994
This paper presents a strong characterization that precisely determines the ability of n–process deterministic types to solve n… (More)
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Position-specific substitution matrices, known as profiles, derived from multiple sequence alignments are currently used to… (More)
Is this relevant?
1991
1991
Gap-detection thresholds were determined for single units in the cochlear ganglion and in auditory nerve fibres of the starling… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
1986
1986
  • Jiawei Hong
  • 27th Annual Symposium on Foundations of Computer…
  • 1986
This paper proposes a proving_by_example method, which works as follows: Given a geometry proposition we can easily present a… (More)
Is this relevant?