Results 1  10
of
392
Graded Multicategories of Polynomialtime Realizers (Extended Abstract)
 DEPARTMENT OF MATHEMATICS DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE MCGILL UNIVERSITY JOHN ABBOTT COLLEGE MONASH UNIVERSITY 805 SHERBROOKE ST
, 1989
"... We present a logical calculus which imposes a grading on a sequentstyle calculus to account for the runtime of the programmes represented by the sequents. This system is sound for a notion of polynomialtime realizability. An extension of the grading is also considered, giving a notion of "dep ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We present a logical calculus which imposes a grading on a sequentstyle calculus to account for the runtime of the programmes represented by the sequents. This system is sound for a notion of polynomialtime realizability. An extension of the grading is also considered, giving a notion of "
A Logical Calculus for Polynomialtime Realizability
 Journal of Methods of Logic in Computer Science
, 1991
"... A logical calculus, not unlike Gentzen's sequent calculus for intuitionist logic, is described which is sound for polynomialtime realizability as defined by Crossley and Remmel. The sequent calculus admits cut elimination, thus giving a decision procedure for the propositional fragment. 0 Intr ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
A logical calculus, not unlike Gentzen's sequent calculus for intuitionist logic, is described which is sound for polynomialtime realizability as defined by Crossley and Remmel. The sequent calculus admits cut elimination, thus giving a decision procedure for the propositional fragment. 0
Polynomialtime algorithms from ineffective proofs
 In Proc. of the Eighteenth Annual IEEE Symposium on Logic in Computer Science LICS’03
, 2003
"... We present a constructive procedure for extracting polynomialtime realizers from ineffective proofs of 02theorems in feasible analysis. By ineffective proof we mean a proof which involves the noncomputational principle weak König’s lemma WKL, and by feasible analysis we mean Cook and Urquhart’s ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We present a constructive procedure for extracting polynomialtime realizers from ineffective proofs of 02theorems in feasible analysis. By ineffective proof we mean a proof which involves the noncomputational principle weak König’s lemma WKL, and by feasible analysis we mean Cook and Urquhart’s
PolynomialTime Hierarchy on Randomized Machines
"... 1 Introduction Proving lower bounds remains one of the most challenging tasks in computationalcomplexity. Satisfiability, the seminal NPcomplete problem, is particularly unyielding in this respect. While we believe that any algorithm for satisfiabilitytakes time linear exponential in the number of ..."
Abstract
 Add to MetaCart
of variables in the formula, we have been unable to prove superlinear time lower bounds on random access machinesdespite several decades of effort. Additionally, problems complete for higher levels of the polynomialtime hierarchy, while not receiving as much attention, havealso resisted nontrivial time lower
CEL—a polynomialtime reasoner for life science ontologies
 Proc. of the 3rd Int. Joint Conf. on Automated Reasoning (IJCAR’06), volume 4130 of Lecture Notes in Artificial Intelligence
, 2006
"... Abstract. CEL (Classifier for EL) is a reasoner for the small description logic EL + which can be used to compute the subsumption hierarchy induced by EL + ontologies. The most distinguishing feature of CEL is that, unlike all other modern DL reasoners, it is based on a polynomialtime subsumption a ..."
Abstract

Cited by 95 (21 self)
 Add to MetaCart
Abstract. CEL (Classifier for EL) is a reasoner for the small description logic EL + which can be used to compute the subsumption hierarchy induced by EL + ontologies. The most distinguishing feature of CEL is that, unlike all other modern DL reasoners, it is based on a polynomialtime subsumption
An arithmetic for nonsizeincreasing polynomialtime computation
 Theoretical Computer Science
"... Abstract An arithmetical system is presented with the property that from every proof a realizing term can be extracted that is deÿnable in a certain a ne linear typed variant of G odel's T and therefore deÿnes a nonsizeincreasing polynomial time computable function. ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
Abstract An arithmetical system is presented with the property that from every proof a realizing term can be extracted that is deÿnable in a certain a ne linear typed variant of G odel's T and therefore deÿnes a nonsizeincreasing polynomial time computable function.
Scaling up SelfExplanatory Simulators: Polynomialtime compilation
, 1995
"... Selfexplanatory simulators have many potential applications, including supporting engineering activities, intelligent tutoring systems, and computerbased training systems. To fully realize this potential requires improving the technology to efficiently generate highly optimized simulators. This p ..."
Abstract

Cited by 23 (8 self)
 Add to MetaCart
. This paper describes an algorithm for compiling selfexplanatory simulators that operates in polynomial time. It is capable of constructing selfexplanatory simulators with thousands of parameters, which is an order of magnitude more complex than any previous technique. The algorithm is fully imple
A polynomialtime algorithm to design push plans for sensorless parts sorting
"... We consider the efficient computation of sequences of push actions that simultaneously orient two different polygons. Our motivation for studying this problem comes from the observation that appropriately oriented parts admit simple sensorless sorting. We study the sorting of two polygonal parts by ..."
Abstract
 Add to MetaCart
by first putting them in properly selected orientations. We give an O(n 2 log n)time algorithm to enumerate all pairs of orientations for the two parts that can be realized by a sequence of push actions and admit sensorless sorting. We then propose an O(n 4 log 2 n)time algorithm for finding the shortest
Polynomialtime Perfect Sampler for Closed Jackson Networks with Single Servers
"... Abstract In this paper, we propose a sampler for the productform solution of basic queueing networks, closed Jackson networks with single servers. Our approach is sampling via Markov chain, but it is NOT a simulation of behavior of customers in queueing networks. We propose a new ergodic Markov cha ..."
Abstract
 Add to MetaCart
chain whose unique stationary distribution is the product form solution of a closed Jackson Network, thus we can sample from the product form solution without knowing the value of its normalizing constant. The sampler is based on monotone Coupling from the Past (monotone CFTP) and realizes the sampling
Results 1  10
of
392