Results 1  10
of
1,707,109
The Complexity of the Local Hamiltonian Problem
 In Proc. of 24th FSTTCS
, 2004
"... The kLOCAL HAMILTONIAN problem is a natural complete problem for the complexity class QMA, the quantum analog of NP. It is similar in spirit to MAXkSAT, which is NPcomplete for k ≥ 2. It was known that the problem is QMAcomplete for any k ≥ 3. On the other hand 1LOCAL HAMILTONIAN is in P, and h ..."
Abstract

Cited by 80 (6 self)
 Add to MetaCart
The kLOCAL HAMILTONIAN problem is a natural complete problem for the complexity class QMA, the quantum analog of NP. It is similar in spirit to MAXkSAT, which is NPcomplete for k ≥ 2. It was known that the problem is QMAcomplete for any k ≥ 3. On the other hand 1LOCAL HAMILTONIAN is in P
The Complexity of Stoquastic Local Hamiltonian Problems
, 2008
"... We study the complexity of the Local Hamiltonian Problem (denoted as LHMIN) in the special case when a Hamiltonian obeys the condition that all offdiagonal matrix elements in the standard basis are real and nonpositive. We will call such Hamiltonians, which are common in the natural world, stoqua ..."
Abstract
 Add to MetaCart
We study the complexity of the Local Hamiltonian Problem (denoted as LHMIN) in the special case when a Hamiltonian obeys the condition that all offdiagonal matrix elements in the standard basis are real and nonpositive. We will call such Hamiltonians, which are common in the natural world
The complexity of stoquastic local hamiltonian problems. Arxiv: quantph/0606140
, 2006
"... We study the complexity of the Local Hamiltonian Problem (denoted as LHMIN) in the special case when a Hamiltonian obeys conditions of the PerronFrobenius theorem: all offdiagonal matrix elements in the standard basis are real and nonpositive. We will call such Hamiltonians, which are common in ..."
Abstract

Cited by 22 (5 self)
 Add to MetaCart
We study the complexity of the Local Hamiltonian Problem (denoted as LHMIN) in the special case when a Hamiltonian obeys conditions of the PerronFrobenius theorem: all offdiagonal matrix elements in the standard basis are real and nonpositive. We will call such Hamiltonians, which are common
Parameterized Complexity
, 1998
"... the rapidly developing systematic connections between FPT and useful heuristic algorithms  a new and exciting bridge between the theory of computing and computing in practice. The organizers of the seminar strongly believe that knowledge of parameterized complexity techniques and results belongs ..."
Abstract

Cited by 1218 (75 self)
 Add to MetaCart
the rapidly developing systematic connections between FPT and useful heuristic algorithms  a new and exciting bridge between the theory of computing and computing in practice. The organizers of the seminar strongly believe that knowledge of parameterized complexity techniques and results belongs
Linguistic Complexity: Locality of Syntactic Dependencies
 COGNITION
, 1998
"... This paper proposes a new theory of the relationship between the sentence processing mechanism and the available computational resources. This theory  the Syntactic Prediction Locality Theory (SPLT)  has two components: an integration cost component and a component for the memory cost associa ..."
Abstract

Cited by 486 (31 self)
 Add to MetaCart
This paper proposes a new theory of the relationship between the sentence processing mechanism and the available computational resources. This theory  the Syntactic Prediction Locality Theory (SPLT)  has two components: an integration cost component and a component for the memory cost
Locally weighted learning
 ARTIFICIAL INTELLIGENCE REVIEW
, 1997
"... This paper surveys locally weighted learning, a form of lazy learning and memorybased learning, and focuses on locally weighted linear regression. The survey discusses distance functions, smoothing parameters, weighting functions, local model structures, regularization of the estimates and bias, ass ..."
Abstract

Cited by 594 (53 self)
 Add to MetaCart
This paper surveys locally weighted learning, a form of lazy learning and memorybased learning, and focuses on locally weighted linear regression. The survey discusses distance functions, smoothing parameters, weighting functions, local model structures, regularization of the estimates and bias
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
Statistical mechanics of complex networks
 Rev. Mod. Phys
"... Complex networks describe a wide range of systems in nature and society, much quoted examples including the cell, a network of chemicals linked by chemical reactions, or the Internet, a network of routers and computers connected by physical links. While traditionally these systems were modeled as ra ..."
Abstract

Cited by 2083 (10 self)
 Add to MetaCart
Complex networks describe a wide range of systems in nature and society, much quoted examples including the cell, a network of chemicals linked by chemical reactions, or the Internet, a network of routers and computers connected by physical links. While traditionally these systems were modeled
Error and attack tolerance of complex networks
, 2000
"... Many complex systems display a surprising degree of tolerance against errors. For example, relatively simple organisms grow, persist and reproduce despite drastic pharmaceutical or environmental interventions, an error tolerance attributed to the robustness of the underlying metabolic network [1]. C ..."
Abstract

Cited by 974 (6 self)
 Add to MetaCart
]. Complex communication networks [2] display a surprising degree of robustness: while key components regularly malfunction, local failures rarely lead to the loss of the global informationcarrying ability of the network. The stability of these and other complex systems is often attributed to the redundant
A PERFORMANCE EVALUATION OF LOCAL DESCRIPTORS
, 2005
"... In this paper we compare the performance of descriptors computed for local interest regions, as for example extracted by the HarrisAffine detector [32]. Many different descriptors have been proposed in the literature. However, it is unclear which descriptors are more appropriate and how their perfo ..."
Abstract

Cited by 1752 (53 self)
 Add to MetaCart
In this paper we compare the performance of descriptors computed for local interest regions, as for example extracted by the HarrisAffine detector [32]. Many different descriptors have been proposed in the literature. However, it is unclear which descriptors are more appropriate and how
Results 1  10
of
1,707,109