Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
293,217
Polynomial-Time Membership Comparable Sets
, 1994
"... This paper studies a notion called polynomial-time membership comparable sets. For a function g, a set A is polynomial-time g-membership comparable if there is a polynomialtime computable function f such that for any x 1 ; \Delta \Delta \Delta ; xm with m g(maxfjx 1 j; \Delta \Delta \Delta ; jx m j ..."
Abstract
-
Cited by 32 (5 self)
- Add to MetaCart
membership comparable sets have polynomial-size circuits. 3. For any function f and for any constant c ? 0, if a set is p f(n)-tt -reducible to a Pselective set, then the set is polynomial-time (1 + c) log f(n)-membership comparable. 4. For any C chosen from fPSPACE;UP;FewP;NP;C=P;PP;MOD 2 P; MOD 3 P
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- Journal of the ACM
, 1998
"... Abstract. We present a polynomial time approximation scheme for Euclidean TSP in fixed dimensions. For every fixed c Ͼ 1 and given any n nodes in 2 , a randomized version of the scheme finds a (1 ϩ 1/c)-approximation to the optimum traveling salesman tour in O(n(log n) O(c) ) time. When the nodes ..."
Abstract
-
Cited by 397 (2 self)
- Add to MetaCart
Abstract. We present a polynomial time approximation scheme for Euclidean TSP in fixed dimensions. For every fixed c Ͼ 1 and given any n nodes in 2 , a randomized version of the scheme finds a (1 ϩ 1/c)-approximation to the optimum traveling salesman tour in O(n(log n) O(c) ) time. When the nodes
Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines
- SIAM JOURNAL ON COMPUTING
, 2006
"... We establish the first polynomial-strength time-space lower bounds for problems in the linear-time hierarchy on randomized machines with two-sided error. We show that for any integer ℓ> 1 and constant c < ℓ, there exists a positive constant d such that QSAT ℓ cannot be computed by such machine ..."
Abstract
-
Cited by 16 (5 self)
- Add to MetaCart
We establish the first polynomial-strength time-space lower bounds for problems in the linear-time hierarchy on randomized machines with two-sided error. We show that for any integer ℓ> 1 and constant c < ℓ, there exists a positive constant d such that QSAT ℓ cannot be computed
Polynomial-time construction of contraction hierarchies for multi-criteria objectives
- In In Workshop on Algorithm Engineering and Experiments (ALENEX
"... In this paper we consider a variant of the multi-criteria short-est path problem where the different criteria are combined in an arbitrary conic combination at query time. We show that contraction hierarchies (CH)- a very powerful speed-up technique originally developed for standard shortest path qu ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
-traction operation during the CH construction can be per-formed in polynomial-time, while on the more practical side we complement our theoretical results with experiments on real-world data. Our approach extends previous results (Geis-berger, Kobitzsch, and Sanders 2010) which only considered the bicriteria case
Polynomial-time multi-selectivity
, 1997
"... We introduce a generalization of Selman's P-selectivity that yields a more flexible notion of selectivity, called (polynomial-time) multi-selectivity, in which the selector is allowed to operate on multiple input strings. Since our introduction of this class, it has been used [HJRW96] to prove ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
and the properties of SH and completely establish, in terms of incomparability and strict inclusion, the relations between our generalized selectivity classes and Ogihara's P-mc (polynomial-time membership-comparable) classes. Although SH is a strictly increasing infinite hierarchy, we show that the core
Notes on polynomial-time group theory
- CWI Quarterly
, 1992
"... Througbout. I.bis pap(!! ' h,t. C; (I') hn a subgrollp of 8 " generated by a subset l ' which may I)(! asslllllPd t() 1)() 'Slltal1 ' (Hay, of Hi~() < n2; d. Theorem 2.4iv). Tlw)1;o,tl will h( ' to (·OIll[Jlll.()]H·o])(!!'l.i(!s of c: '(1fliciellLly&ap ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Througbout. I.bis pap(!! ' h,t. C; (I') hn a subgrollp of 8 " generated by a subset l ' which may I)(! asslllllPd t() 1)() 'Slltal1 ' (Hay, of Hi~() < n2; d. Theorem 2.4iv). Tlw)1;o,tl will h( ' to (·OIll[Jlll.()]H·o])(!!'l.i(!s of c: '(1fliciell
The Class NP Nondeterministic polynomial-time
"... A language L (equivalently decision problem) is in the class P if there is a polynomial time algorithm A for deciding L; Given a string x, A correctly decides if x ∈ L and running time of A on x is polynomial in |x|, the length of x. Given a context-free grammar and a string, can that string be g ..."
Abstract
- Add to MetaCart
A language L (equivalently decision problem) is in the class P if there is a polynomial time algorithm A for deciding L; Given a string x, A correctly decides if x ∈ L and running time of A on x is polynomial in |x|, the length of x. Given a context-free grammar and a string, can that string
An Implicit Characterization of the Polynomial-Time Decidable Sets by Cons-Free Rewriting
"... Abstract. We define the class of constrained cons-free rewriting systems and show that this class characterizes P, the set of languages decidable in polynomial time on a deterministic Turing machine. The main nov-elty of the characterization is that it allows very liberal properties of term rewritin ..."
Abstract
- Add to MetaCart
Abstract. We define the class of constrained cons-free rewriting systems and show that this class characterizes P, the set of languages decidable in polynomial time on a deterministic Turing machine. The main nov-elty of the characterization is that it allows very liberal properties of term
Results 1 - 10
of
293,217
