Results 1  10
of
299,996
On Semantic and TypeTheoretic Aspects of PolynomialTime Computability
, 2001
"... This thesis strives to combine two traditions in theoretical computer science: complexity theory and denotational semantics. The recently proposed setting of game semantics, which provided first syntaxindependent fully abstract models of many programming languages, is used to characterize the polyn ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
is achieved through a faithful characterization of the space of proofs in light affine logic, which itself captures polynomialtime computation by the process of cutelimination. A representation theory of proofs, extending essential nets for intuitionistic linear logic, is developed for light ane logic
Polynomialtime Computation via Local Inference Relations
 ACM TRANS. COMPUT. LOGIC
, 2000
"... We consider the concept of a local set of inference rules. A local rule set can be automatically transformed into a rule set for which bottomup evaluation terminates in polynomial time. The localruleset transformation gives polynomialtime evaluation strategies for a large variety of rule sets th ..."
Abstract

Cited by 23 (0 self)
 Add to MetaCart
We consider the concept of a local set of inference rules. A local rule set can be automatically transformed into a rule set for which bottomup evaluation terminates in polynomial time. The localruleset transformation gives polynomialtime evaluation strategies for a large variety of rule sets
Polynomialtime computation in matrix groups
, 1999
"... This dissertation investigates deterministic polynomialtime computation in matrix groups over finite fields. Of particular interest are matrixgroup problems that resemble testing graph isomorphism. The main results are instances where the problems admit polynomialtime solutions and methods that e ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
This dissertation investigates deterministic polynomialtime computation in matrix groups over finite fields. Of particular interest are matrixgroup problems that resemble testing graph isomorphism. The main results are instances where the problems admit polynomialtime solutions and methods
Structure of PolynomialTime Approximation
, 2009
"... Approximation schemes are commonly classified as being either a polynomialtime approximation scheme (ptas) or a fully polynomialtime approximation scheme (fptas). To properly differentiate between approximation schemes for concrete problems, several subclasses have been identified: (optimum)asymp ..."
Abstract
 Add to MetaCart
Approximation schemes are commonly classified as being either a polynomialtime approximation scheme (ptas) or a fully polynomialtime approximation scheme (fptas). To properly differentiate between approximation schemes for concrete problems, several subclasses have been identified: (optimum
Polynomialtime multiselectivity
, 1997
"... We introduce a generalization of Selman's Pselectivity that yields a more flexible notion of selectivity, called (polynomialtime) multiselectivity, 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
We introduce a generalization of Selman's Pselectivity that yields a more flexible notion of selectivity, called (polynomialtime) multiselectivity, in which the selector is allowed to operate on multiple input strings. Since our introduction of this class, it has been used [HJRW96
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
Random polynomialtime attacks and DolevYao models
"... Keywords: Cryptographic protocols, random polynomial time, DolevYao model, Markov decision processes. 1 Introduction Proving the security of cryptographic protocols has been a major concern ever since flaws werefirst discovered in some established protocols, the most wellknown example being [20]. ..."
Abstract
 Add to MetaCart
include virtually all logical attacks implementable by aprobabilistic polynomialtime Turing machine. In this approach a proof of security consists in a reduction proof: from any hypothetical attack it shows how to build a random polynomial
Polygraphic programs and polynomialtime functions
"... Abstract – We study the computational model of polygraphs. For that, we consider polygraphic programs, a subclass of these objects, as a formal description of firstorder functional programs. We explain their semantics and prove that they form a Turingcomplete computational model. Their algebraic s ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
structure is used by analysis tools, called polygraphic interpretations, for complexity analysis. In particular, we delineate a subclass of polygraphic programs that compute exactly the functions that are Turingcomputable in polynomial time.
PolynomialTime SemiRankable Sets
 Special Issue: Proceedings of the 8th International Conference on Computing and Information
, 1995
"... We study the polynomialtime semirankable sets (Psr), the ranking analog of the Pselective sets. We prove that Psr is a strict subset of the Pselective sets, and indeed that the two classes differ with respect to closure under complementation, closure under union with P sets, closure under join ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
We study the polynomialtime semirankable sets (Psr), the ranking analog of the Pselective sets. We prove that Psr is a strict subset of the Pselective sets, and indeed that the two classes differ with respect to closure under complementation, closure under union with P sets, closure under
Quest
"... Some implications of the view that mind is a suitably complex kind of process are investigated in various contexts. The underlying theme is that the behavior of complex systems cannot be adequately judged by that of simple systems. I rst present a personal exploration of the mechanistic account of m ..."
Abstract
 Add to MetaCart
of mind in terms of nontechnical considerations; then I present and criticize some ideas of Kripke, Nagel, and Jackson that challenge the mechanistic view. Next I turn to a brief synopsis of some of Dennett's recent ideas. Finally I oer some critical comments on Dennett's views and suggest
Results 1  10
of
299,996