Results 11  20
of
518,157
Polynomial Time Samplable Distributions
 Proc. Mathematical Foundations of Computer Science
, 1995
"... This paper studies distributions which can be "approximated" by sampling algorithms in time polynomial in the length of their outputs. First, it is known that if polynomialtime samplable distributions are polynomialtime computable, then NP collapses to P. This paper shows by a simple cou ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
This paper studies distributions which can be "approximated" by sampling algorithms in time polynomial in the length of their outputs. First, it is known that if polynomialtime samplable distributions are polynomialtime computable, then NP collapses to P. This paper shows by a simple
On Polynomial Time Computable Numbers
, 2006
"... It will be shown that the polynomial time computable numbers form a field, and especially an algebraically closed field. 1 ..."
Abstract
 Add to MetaCart
It will be shown that the polynomial time computable numbers form a field, and especially an algebraically closed field. 1
Soft Linear Logic and Polynomial Time
 THEORETICAL COMPUTER SCIENCE
, 2002
"... We present a subsystem of second order Linear Logic with restricted rules for exponentials so that proofs correspond to polynomial time algorithms, and viceversa. ..."
Abstract

Cited by 78 (0 self)
 Add to MetaCart
We present a subsystem of second order Linear Logic with restricted rules for exponentials so that proofs correspond to polynomial time algorithms, and viceversa.
Ultimate Polynomial Time
, 1999
"... The class UP of ‘ultimate polynomial time ’ problems over C is introduced; it contains the class P of polynomial time problems over C. The τConjecture for polynomials implies that UP does not contain the class of nondeterministic polynomial time problems definable without constants over C. This la ..."
Abstract
 Add to MetaCart
The class UP of ‘ultimate polynomial time ’ problems over C is introduced; it contains the class P of polynomial time problems over C. The τConjecture for polynomials implies that UP does not contain the class of nondeterministic polynomial time problems definable without constants over C
Optimal Oblivious Routing in Polynomial Time
, 2003
"... A recent seminal result of Räcke is that for any network there is an oblivious routing algorithm with a polylog competitive ratio with respect to congestion. Unfortunately, Räcke's construction is not polynomial time. We give a polynomial time construction that guarantee's Räcke's bou ..."
Abstract

Cited by 74 (9 self)
 Add to MetaCart
A recent seminal result of Räcke is that for any network there is an oblivious routing algorithm with a polylog competitive ratio with respect to congestion. Unfortunately, Räcke's construction is not polynomial time. We give a polynomial time construction that guarantee's Räcke
Enumeration Reducibility with Polynomial Time
"... Abstract. We introduce polynomial time enumeration reducibility (≤pe) and we retrace Selman’s analysis of this reducibility and its relationship with non deterministic polynomial time conjunctive reducibility. We discuss the basic properties of the degree structure induced by ≤pe over the computable ..."
Abstract
 Add to MetaCart
Abstract. We introduce polynomial time enumeration reducibility (≤pe) and we retrace Selman’s analysis of this reducibility and its relationship with non deterministic polynomial time conjunctive reducibility. We discuss the basic properties of the degree structure induced by ≤pe over
The Analytic PolynomialTime Hierarchy
 Mathematical Logic Quaterly
, 1997
"... Motivated by results on interactive proof systems we investigate an 98hierarchy over P using word quantifiers as well as two types of set quantifiers. This hierarchy, which extends the (arithmetic) polynomialtime hierarchy, is called the analytic polynomialtime hierarchy. It is shown that every ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Motivated by results on interactive proof systems we investigate an 98hierarchy over P using word quantifiers as well as two types of set quantifiers. This hierarchy, which extends the (arithmetic) polynomialtime hierarchy, is called the analytic polynomialtime hierarchy. It is shown
Choiceless Polynomial Time
, 2000
"... Turing machines define polynomial time (PTime) on strings but cannot deal with structures like graphs directly, and there is no known, easily computable string encoding of isomorphism classes of structures. Is there a computation model whose machines do not distinguish between isomorphic structures ..."
Abstract

Cited by 29 (6 self)
 Add to MetaCart
Turing machines define polynomial time (PTime) on strings but cannot deal with structures like graphs directly, and there is no known, easily computable string encoding of isomorphism classes of structures. Is there a computation model whose machines do not distinguish between isomorphic structures
Polynomialtime normalizers
"... For an integer constant d>0, let Γd denote the class of finite groups all of whose nonabelian composition factors lie in Sd; in particular, Γd includes all solvable groups. Motivated by applications to graphisomorphism testing, there has been extensive study of the complexity of computation for ..."
Abstract
 Add to MetaCart
for permutation groups in this class. In particular, the problems of finding set stabilizers, intersections and centralizers have all been shown to be polynomialtime computable. A notable open issue for the class Γd has been the question of whether normalizers can be found in polynomial time. We resolve
On polynomial time kernel reductions
, 2011
"... In this paper, we examine a recently introduced type of effective reduction which applies solely to problems of equivalence or isomorphism: the “kernel reduction”. Specifically, we examine reductions among languages in the complexity class consisting of all languages induced by equivalence relations ..."
Abstract
 Add to MetaCart
relations for which membership can be decided by a nondeterministic polynomial time Turing machine. This class is called NPEq; the definitions for PEq and coNPEq are analagous. We prove a general theorem which provides a problem which is hard under polynomial time kernel reductions for several classes
Results 11  20
of
518,157