Results 1  10
of
212
ML with PTIME complexity guarantees ∗
"... Implicit Computational Complexity is a line of research where the possibility to inference a valid property for a program implies that the program runs in particular complexity class. Soft type systems are one of the research threads within the field. We present here a soft type system with MLlike ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Implicit Computational Complexity is a line of research where the possibility to inference a valid property for a program implies that the program runs in particular complexity class. Soft type systems are one of the research threads within the field. We present here a soft type system with ML
Backward Induction is PTIMEcomplete
"... Abstract. We prove that the computational problem of finding backward induction outcome is PTIMEcomplete. Key words: gametheory, backward induction, computational complexity, finite extensive games 1 ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. We prove that the computational problem of finding backward induction outcome is PTIMEcomplete. Key words: gametheory, backward induction, computational complexity, finite extensive games 1
Explicit Muller Games are PTIME
, 2008
"... Regular games provide a very useful model for the synthesis of controllers in reactive systems. The complexity of these games depends on the representation of the winning condition: if it is represented through a winset, a coloured condition, a ZielonkaDAG or EmersonLei formulae, the winner prob ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
Regular games provide a very useful model for the synthesis of controllers in reactive systems. The complexity of these games depends on the representation of the winning condition: if it is represented through a winset, a coloured condition, a ZielonkaDAG or EmersonLei formulae, the winner
XPath Query Satisfiability is in PTIME for
"... Abstract. The problem of XPath query satisfiability under DTDs (Document Type Definitions) is to decide, given an XPath query p and a DTD D, whether or not there is some document valid with respect to D on which p returns a nonempty result. Recent studies in the literature have shown the problem to ..."
Abstract
 Add to MetaCart
: being duplicatefree and being covering. Then we concentrate on the satisfiability problem of XPath queries under such DTDs. We obtain a number of XPath fragments for which the complexity of the satisfiablity problem reduces to PTIME when such realworld DTDs are used.
Flow Analysis, Linearity, and PTIME
"... Abstract. Flow analysis is a ubiquitous and muchstudied component of compiler technology—and its variations abound. Amongst the most well known is Shivers ’ 0CFA; however, the best known algorithm for 0CFA requires time cubic in the size of the analyzed program and is unlikely to be improved. Conse ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
and complexity, what has been given up and what has been gained? Where do these analyses differ and where do they coincide? We identify a core language—the linear λcalculus—where 0CFA, simple closure analysis, and many other known approximations or restrictions to 0CFA are rendered identical. Moreover
FPT is PTime Extremal Structure I.
 In Proc. of Algorithms and Complexity in Durham (ACiD),
, 2005
"... ABSTRACT. We describe a broad program of research in parameterized complexity, and hows this plays out for the MAX LEAF SPANNING TREE problem. ..."
Abstract

Cited by 31 (2 self)
 Add to MetaCart
ABSTRACT. We describe a broad program of research in parameterized complexity, and hows this plays out for the MAX LEAF SPANNING TREE problem.
PTIME Computation of Transitive Closures of Octagonal Relations
"... Abstract. Computing transitive closures of integer relations is the key to finding precise invariants of integer programs. In this paper, we study difference bounds and octagonal relations and prove that their transitive closure is a PTIMEcomputable formula in the existential fragment of Presburge ..."
Abstract
 Add to MetaCart
Abstract. Computing transitive closures of integer relations is the key to finding precise invariants of integer programs. In this paper, we study difference bounds and octagonal relations and prove that their transitive closure is a PTIMEcomputable formula in the existential fragment
A logic for PTIME and a parameterized halting problem
 ELECTRONIC COLLOQUIUM ON COMPUTATIONAL COMPLEXITY, REPORT NO. 83
, 2008
"... In [2] a logic LY has been introduced as a possible candidate for a logic capturing the PTIME properties of structures (even in the absence of an ordering of their universe). A reformulation of this problem in terms of a parameterized halting problem pACC for nondeterministic Turing machines has be ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
In [2] a logic LY has been introduced as a possible candidate for a logic capturing the PTIME properties of structures (even in the absence of an ordering of their universe). A reformulation of this problem in terms of a parameterized halting problem pACC for nondeterministic Turing machines has
Memoization for Unary Logic Programming: Characterizing PTIME
"... We give a characterization of deterministic polynomial time computation based on an algebraic structure called the resolution semiring, whose elements can be understood as logic programs or sets of rewriting rules over firstorder terms. More precisely, we study the restriction of this framework to ..."
Abstract
 Add to MetaCart
approach and complexity results to complexity of logic programming. As an application of our techniques, we show a PTIMEcompleteness result for a class of logic programming queries which use only unary function symbols.
Applications and Extensions of PTIME Description Logics with Functional Constraints ∗
"... We review and extend earlier work on the logic CFD, a description logic that allows terminological cycles with universal restrictions over functional roles. In particular, we consider the problem of reasoning about concept subsumption and the problem of computing certain answers for a family of attr ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
of attributeconnected conjunctive queries, showing that both problems are in PTIME. We then consider the effect on the complexity of these problems after adding a concept constructor that expresses concept union, or after adding a concept constructor for the bottom class. Finally, we show that adding both
Results 1  10
of
212