Results 1  10
of
968
The complexity of theoremproving procedures
 IN STOC
, 1971
"... It is shown that any recognition problem solved by a polynomial timebounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a tautology. Here “reduced ” means, roughly speaking, that the first problem can be solved deterministi ..."
Abstract

Cited by 1050 (5 self)
 Add to MetaCart
deterministically in polynomial time provided an oracle is available for solving the second. From this notion of reducible, polynomial degrees of difficulty are defined, and it is shown that the problem of determining tautologyhood has the same polynomial degree as the problem of determining whether the first
On nonlinear dynamics of . . .
, 2009
"... In this survey, we briefly review some of our recent studies on predatorprey models with discrete delay. We first study the distribution of zeros of a second degree transcendental polynomial. Then we apply the general results on the distribution of zeros of the second degree transcendental polyno ..."
Abstract
 Add to MetaCart
In this survey, we briefly review some of our recent studies on predatorprey models with discrete delay. We first study the distribution of zeros of a second degree transcendental polynomial. Then we apply the general results on the distribution of zeros of the second degree transcendental
Complexity of finding embeddings in a ktree
 SIAM JOURNAL OF DISCRETE MATHEMATICS
, 1987
"... A ktree is a graph that can be reduced to the kcomplete graph by a sequence of removals of a degree k vertex with completely connected neighbors. We address the problem of determining whether a graph is a partial graph of a ktree. This problem is motivated by the existence of polynomial time al ..."
Abstract

Cited by 386 (1 self)
 Add to MetaCart
A ktree is a graph that can be reduced to the kcomplete graph by a sequence of removals of a degree k vertex with completely connected neighbors. We address the problem of determining whether a graph is a partial graph of a ktree. This problem is motivated by the existence of polynomial time
Digital step edges from zero crossing of second directional derivatives
 Pattern Analysis and Machine Intelligence, IEEE Transactions on
, 1984
"... AbstractWe use the facet model to accomplish step edge detection. The essence of the facet model is that any analysis made on the basis of the pixel values in some neighborhood has its final authoritative interpretation relative to the underlying gray tone intensity surface of which the neighborho ..."
Abstract

Cited by 200 (5 self)
 Add to MetaCart
of discrete orthogonal polynomials of up to degree three. The appropriate directional derivatives are easily computed from this kind of a function. Upon comparing the performance of this zero crossing of second directional derivative operator with the Prewitt gradient operator and the MarrHildreth zero
On the complexity of the parity argument and other inefficient proofs of existence
 JCSS
, 1994
"... We define several new complexity classes of search problems, "between " the classes FP and FNP. These new classes are contained, along with factoring, and the class PLS, in the class TFNP of search problems in FNP that always have a witness. A problem in each of these new classes is define ..."
Abstract

Cited by 205 (8 self)
 Add to MetaCart
; The new classes are based on lemmata such as "every graph has an even number of odddegree nodes. " They contain several important problems for which no polynomial time algorithm is presently known, including the computational versions of Sperner's lemma, Brouwer's fixpoint theorem
Improved lowdegree testing and its applications
 IN 29TH STOC
, 1997
"... NP = PCP(log n, 1) and related results crucially depend upon the close connection betsveen the probability with which a function passes a low degree test and the distance of this function to the nearest degree d polynomial. In this paper we study a test proposed by Rubinfeld and Sudan [29]. The stro ..."
Abstract

Cited by 142 (17 self)
 Add to MetaCart
NP = PCP(log n, 1) and related results crucially depend upon the close connection betsveen the probability with which a function passes a low degree test and the distance of this function to the nearest degree d polynomial. In this paper we study a test proposed by Rubinfeld and Sudan [29
SelfCorrecting for Function Fields of Finite Transcendental Degree
, 1995
"... We use algebraic field extension theory to find selfcorrectors for a broad class of functions. Many functions whose translations are contained in a function field that is a finite degree extension of a scalar field satisfy polynomial identities that can be transformed into selfcorrectors. These fu ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We use algebraic field extension theory to find selfcorrectors for a broad class of functions. Many functions whose translations are contained in a function field that is a finite degree extension of a scalar field satisfy polynomial identities that can be transformed into self
Algebraic Dynamics and Transcendental Numbers
"... Abstract. A first example of a connection between transcendental numbers and complex dynamics is the following. Let p and q be polynomials with complex coefficients of the same degree. A classical result of Böttcher states that p and q are locally conjugates in a neighborhood of ∞: there exists a fu ..."
Abstract
 Add to MetaCart
Abstract. A first example of a connection between transcendental numbers and complex dynamics is the following. Let p and q be polynomials with complex coefficients of the same degree. A classical result of Böttcher states that p and q are locally conjugates in a neighborhood of ∞: there exists a
Semihyperbolic transcendental Semigroups
, 1999
"... This paper deals with semihyperbolic semigroups which are generated by entire (possibly transcendental) functions. In particular, a criterion is given assuring that a given entire semigroup is semihyperbolic. Note that a semihyperbolic semigroup G admit holomorphic scaling, that is to say, the branc ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
, the branches of local inverses of functions f 2 G are of bounded degree and that the preimages shrink to zero in diameter. Key words: complex dynamic, iteration, Julia set, Fatou set, Julia set, semigroup, semihyperbolic, transcendental function 1991 Mathematical Subject Classification: 30D05, 54H20, 58F08, 58
Coil sensitivity encoding for fast MRI. In:
 Proceedings of the ISMRM 6th Annual Meeting,
, 1998
"... New theoretical and practical concepts are presented for considerably enhancing the performance of magnetic resonance imaging (MRI) by means of arrays of multiple receiver coils. Sensitivity encoding (SENSE) is based on the fact that receiver sensitivity generally has an encoding effect complementa ..."
Abstract

Cited by 193 (3 self)
 Add to MetaCart
image for each array element using discrete Fourier transform (DFT). The second step then is to create a fullFOV image from the set of intermediate images. To achieve this one must undo the signal superposition underlying the foldover effect. That is, for each pixel in the reduced FOV the signal
Results 1  10
of
968