Results 1  10
of
765,525
The triviality problem for profinite completions
, 2013
"... Abstract. We prove that there is no algorithm that can determine whether or not a finitely presented group has a nontrivial finite quotient; indeed, this remains undecidable among the fundamental groups of compact, nonpositively curved square complexes. We deduce that many other properties of gr ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Abstract. We prove that there is no algorithm that can determine whether or not a finitely presented group has a nontrivial finite quotient; indeed, this remains undecidable among the fundamental groups of compact, nonpositively curved square complexes. We deduce that many other properties
Triviality problem for nilisotropic automorphisms
 on CR manifolds, Bonner Math. Schriften 338
, 2001
"... We present a survey on the effect of triviality of nilisotropic automorphisms of realanalytic nonquadratic Levi nondegenerate CR manifolds. As a new result we prove that any isotropic automorphism of an elliptic CRmanifold in C4 is uniquely determined by its first order derivatives at the orig ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We present a survey on the effect of triviality of nilisotropic automorphisms of realanalytic nonquadratic Levi nondegenerate CR manifolds. As a new result we prove that any isotropic automorphism of an elliptic CRmanifold in C4 is uniquely determined by its first order derivatives
1 The Nontrivial Problem of Crossdisciplinary Science and
, 2010
"... Crossdisciplinary use of science is needed to solve complex, realworld problems, but carrying out scientific research with multiple very different disciplines is in itself a nontrivial problem. Perspectives matter. In this paper we carry out a philosophical analysis of the perspectival nature of ..."
Abstract
 Add to MetaCart
Crossdisciplinary use of science is needed to solve complex, realworld problems, but carrying out scientific research with multiple very different disciplines is in itself a nontrivial problem. Perspectives matter. In this paper we carry out a philosophical analysis of the perspectival nature
Extreme Eigenvalues of Random MatricesA Trivial Problem
, 2009
"... Plan: • The problem & its origin • Top eigenvalue λmax of a Gaussian random matrix and its large deviations S.N. Majumdar Extreme Eigenvalues of Random MatricesPlan Plan: • The problem & its origin • Top eigenvalue λmax of a Gaussian random matrix and its large deviations • Prob. distr. of λ ..."
Abstract
 Add to MetaCart
Plan: • The problem & its origin • Top eigenvalue λmax of a Gaussian random matrix and its large deviations S.N. Majumdar Extreme Eigenvalues of Random MatricesPlan Plan: • The problem & its origin • Top eigenvalue λmax of a Gaussian random matrix and its large deviations • Prob. distr
Where the REALLY Hard Problems Are
 IN J. MYLOPOULOS AND R. REITER (EDS.), PROCEEDINGS OF 12TH INTERNATIONAL JOINT CONFERENCE ON AI (IJCAI91),VOLUME 1
, 1991
"... It is well known that for many NPcomplete problems, such as KSat, etc., typical cases are easy to solve; so that computationally hard cases must be rare (assuming P != NP). This paper shows that NPcomplete problems can be summarized by at least one "order parameter", and that the hard p ..."
Abstract

Cited by 681 (1 self)
 Add to MetaCart
It is well known that for many NPcomplete problems, such as KSat, etc., typical cases are easy to solve; so that computationally hard cases must be rare (assuming P != NP). This paper shows that NPcomplete problems can be summarized by at least one "order parameter", and that the hard
The Extended Linear Complementarity Problem
, 1993
"... We consider an extension of the horizontal linear complementarity problem, which we call the extended linear complementarity problem (XLCP). With the aid of a natural bilinear program, we establish various properties of this extended complementarity problem; these include the convexity of the biline ..."
Abstract

Cited by 776 (28 self)
 Add to MetaCart
We consider an extension of the horizontal linear complementarity problem, which we call the extended linear complementarity problem (XLCP). With the aid of a natural bilinear program, we establish various properties of this extended complementarity problem; these include the convexity
The Hungarian method for the assignment problem
 Naval Res. Logist. Quart
, 1955
"... Assuming that numerical scores are available for the performance of each of n persons on each of n jobs, the "assignment problem" is the quest for an assignment of persons to jobs so that the sum of the n scores so obtained is as large as possible. It is shown that ideas latent in the work ..."
Abstract

Cited by 1238 (0 self)
 Add to MetaCart
Assuming that numerical scores are available for the performance of each of n persons on each of n jobs, the "assignment problem" is the quest for an assignment of persons to jobs so that the sum of the n scores so obtained is as large as possible. It is shown that ideas latent
The Symbol Grounding Problem
, 1990
"... There has been much discussion recently about the scope and limits of purely symbolic models of the mind and about the proper role of connectionism in cognitive modeling. This paper describes the "symbol grounding problem": How can the semantic interpretation of a formal symbol system be m ..."
Abstract

Cited by 1072 (18 self)
 Add to MetaCart
There has been much discussion recently about the scope and limits of purely symbolic models of the mind and about the proper role of connectionism in cognitive modeling. This paper describes the "symbol grounding problem": How can the semantic interpretation of a formal symbol system
Global Optimization with Polynomials and the Problem of Moments
 SIAM Journal on Optimization
, 2001
"... We consider the problem of finding the unconstrained global minimum of a realvalued polynomial p(x) : R R, as well as the global minimum of p(x), in a compact set K defined by polynomial inequalities. It is shown that this problem reduces to solving an (often finite) sequence of convex linear mat ..."
Abstract

Cited by 569 (47 self)
 Add to MetaCart
We consider the problem of finding the unconstrained global minimum of a realvalued polynomial p(x) : R R, as well as the global minimum of p(x), in a compact set K defined by polynomial inequalities. It is shown that this problem reduces to solving an (often finite) sequence of convex linear
Results 1  10
of
765,525