Results 1  10
of
15,510
On reducibility and symmetry of disjoint NPpairs
, 2001
"... . We consider some problems about pairs of disjoint NP sets. ..."
Abstract

Cited by 31 (0 self)
 Add to MetaCart
. We consider some problems about pairs of disjoint NP sets.
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
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
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
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
Christian Glaßer 1 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
 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 an oracle relative to which the class of disjoint NPpairs does not have a complete pair, an oracle relative
EndtoEnd Routing Behavior in the Internet
, 1996
"... The largescale behavior of routing in the Internet has gone virtually without any formal study, the exception being Chinoy's analysis of the dynamics of Internet routing information [Ch93]. We report on an analysis of 40,000 endtoend route measurements conducted using repeated “traceroutes” ..."
Abstract

Cited by 660 (13 self)
 Add to MetaCart
” between 37 Internet sites. We analyze the routing behavior for pathological conditions, routing stability, and routing symmetry. For pathologies, we characterize the prevalence of routing loops, erroneous routing, infrastructure failures, and temporary outages. We find that the likelihood of encountering
Mtree: An Efficient Access Method for Similarity Search in Metric Spaces
, 1997
"... A new access meth d, called Mtree, is proposed to organize and search large data sets from a generic "metric space", i.e. whE4 object proximity is only defined by a distance function satisfyingth positivity, symmetry, and triangle inequality postulates. We detail algorith[ for insertion o ..."
Abstract

Cited by 652 (38 self)
 Add to MetaCart
A new access meth d, called Mtree, is proposed to organize and search large data sets from a generic "metric space", i.e. whE4 object proximity is only defined by a distance function satisfyingth positivity, symmetry, and triangle inequality postulates. We detail algorith[ for insertion
A calculus for cryptographic protocols: The spi calculus
 Information and Computation
, 1999
"... We introduce the spi calculus, an extension of the pi calculus designed for the description and analysis of cryptographic protocols. We show how to use the spi calculus, particularly for studying authentication protocols. The pi calculus (without extension) suffices for some abstract protocols; the ..."
Abstract

Cited by 919 (55 self)
 Add to MetaCart
We introduce the spi calculus, an extension of the pi calculus designed for the description and analysis of cryptographic protocols. We show how to use the spi calculus, particularly for studying authentication protocols. The pi calculus (without extension) suffices for some abstract protocols; the spi calculus enables us to consider cryptographic issues in more detail. We represent protocols as processes in the spi calculus and state their security properties in terms of coarsegrained notions of protocol equivalence.
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
 SIAM Journal on Optimization
, 1993
"... We study the semidefinite programming problem (SDP), i.e the problem of optimization of a linear function of a symmetric matrix subject to linear equality constraints and the additional condition that the matrix be positive semidefinite. First we review the classical cone duality as specialized to S ..."
Abstract

Cited by 557 (12 self)
 Add to MetaCart
We study the semidefinite programming problem (SDP), i.e the problem of optimization of a linear function of a symmetric matrix subject to linear equality constraints and the additional condition that the matrix be positive semidefinite. First we review the classical cone duality as specialized to SDP. Next we present an interior point algorithm which converges to the optimal solution in polynomial time. The approach is a direct extension of Ye's projective method for linear programming. We also argue that most known interior point methods for linear programs can be transformed in a mechanical way to algorithms for SDP with proofs of convergence and polynomial time complexity also carrying over in a similar fashion. Finally we study the significance of these results in a variety of combinatorial optimization problems including the general 01 integer programs, the maximum clique and maximum stable set problems in perfect graphs, the maximum k partite subgraph problem in graphs, and va...
Results 1  10
of
15,510