Results 1  10
of
3,563
Inseparability and Strong Hypotheses for Disjoint NP Pairs
"... This paper investigates the existence of inseparable disjoint pairs of NP languages and related strong hypotheses in computational complexity. Our main theorem says that, if NP does not have measure 0 in EXP, then there exist disjoint pairs of NP languages that are Pinseparable, in fact TIME(2n k) ..."
Abstract
 Add to MetaCart
This paper investigates the existence of inseparable disjoint pairs of NP languages and related strong hypotheses in computational complexity. Our main theorem says that, if NP does not have measure 0 in EXP, then there exist disjoint pairs of NP languages that are Pinseparable, in fact TIME(2n k)inseparable
Inseparability and Strong Hypotheses for Disjoint NP Pairs
"... This paper investigates the existence of inseparable disjoint pairs of NP languages and related strong hypotheses in computational complexity. Our main theorem says that, if NP does not have measure 0 in EXP, then there exist disjoint pairs of NP languages that are Pinseparable, in fact TIME(2nk)i ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
This paper investigates the existence of inseparable disjoint pairs of NP languages and related strong hypotheses in computational complexity. Our main theorem says that, if NP does not have measure 0 in EXP, then there exist disjoint pairs of NP languages that are Pinseparable, in fact TIME(2nk)inseparable
Disjoint NPPairs
, 2003
"... We study the question of whether the class DisNP of disjoint pairs (A, B) of NPsets contains a complete pair. The question relates to the question of whether optimal proof systems exist, and we relate it to the previously studied question of whether there exists a disjoint pair of NPsets that is N ..."
Abstract

Cited by 23 (8 self)
 Add to MetaCart
sets that is NPhard. We show under reasonable hypotheses that nonsymmetric disjoint NPpairs exist, which provides additional evidence for the existence of Pinseparable disjoint NPpairs. We construct
The English noun phrase in its sentential aspect
, 1987
"... This dissertation is a defense of the hypothesis that the noun phrase is headed by afunctional element (i.e., \nonlexical " category) D, identi ed with the determiner. In this way, the structure of the noun phrase parallels that of the sentence, which is headed by In (ection), under assump ..."
Abstract

Cited by 509 (4 self)
 Add to MetaCart
phrases. The problem of capturing this dual aspect of the Possing construction is heightened by current restrictive views of Xbar theory, which, in particular, rule out the obvious structure for Possing, [NP NP VPing], by virtue of its exocentricity. Consideration of languages in which nouns, even
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 as random graphs, it is increasingly recognized that the topology and evolution of real
Planning Algorithms
, 2004
"... This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning ..."
Abstract

Cited by 1108 (51 self)
 Add to MetaCart
This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning under uncertainty, sensorbased planning, visibility, decisiontheoretic planning, game theory, information spaces, reinforcement learning, nonlinear systems, trajectory planning, nonholonomic planning, and kinodynamic planning.
Reductions between Disjoint NPPairs
 Information and Computation
, 2004
"... We prove that all of the following assertions are equivalent: There is a manyone complete disjoint NPpair; there is a strongly manyone complete disjoint NPpair; there is a Turing complete disjoint NPpair such that all reductions are smart reductions; there is a complete disjoint NPpair for one ..."
Abstract

Cited by 15 (4 self)
 Add to MetaCart
We prove that all of the following assertions are equivalent: There is a manyone complete disjoint NPpair; there is a strongly manyone complete disjoint NPpair; there is a Turing complete disjoint NPpair such that all reductions are smart reductions; there is a complete disjoint NPpair
On provably disjoint NPpairs
 ELECTRONIC COLLOQUIUM ON COMPUTATIONAL COMPLEXITY
, 1994
"... In this paper we study the pairs (U; V ) of disjoint NPsets representable in a theory T of Bounded Arithmetic in the sense that T proves U " V = ;. For a large variety of theories T we exhibit a natural disjoint NPpair which is complete for the class of disjoint NPpairs representable in T ..."
Abstract

Cited by 42 (2 self)
 Add to MetaCart
In this paper we study the pairs (U; V ) of disjoint NPsets representable in a theory T of Bounded Arithmetic in the sense that T proves U " V = ;. For a large variety of theories T we exhibit a natural disjoint NPpair which is complete for the class of disjoint NPpairs representable
Representable Disjoint NPPairs
"... Abstract. We investigate the class of disjoint NPpairs under different reductions. The structure of this class is intimately linked to the simulation order of propositional proof systems, and we make use of the relationship between propositional proof systems and theories of bounded arithmetic as t ..."
Abstract
 Add to MetaCart
as the main tool of our analysis. Specifically we exhibit a pair which is complete under strong reductions for all disjoint NPpairs representable in a theory. We use these pairs to explain the simulation order of NPpairs under these reductions. As corollaries we also get simplified proofs of results
Results 1  10
of
3,563