Results 1  10
of
463
Nonelementary complexities for branching VASS, MELL, and extensions
 In CSLLICS 2014. ACM
, 2014
"... Abstract. We study the complexity of reachability problems on branching extensions of vector addition systems, which allows us to derive new nonelementary complexity bounds for fragments and variants of propositional linear logic. We show that provability in the multiplicative exponential fragmen ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Abstract. We study the complexity of reachability problems on branching extensions of vector addition systems, which allows us to derive new nonelementary complexity bounds for fragments and variants of propositional linear logic. We show that provability in the multiplicative exponential
Factoring wavelet transforms into lifting steps
 J. FOURIER ANAL. APPL
, 1998
"... This paper is essentially tutorial in nature. We show how any discrete wavelet transform or two band subband filtering with finite filters can be decomposed into a finite sequence of simple filtering steps, which we call lifting steps but that are also known as ladder structures. This decompositio ..."
Abstract

Cited by 584 (8 self)
 Add to MetaCart
in the biorthogonal, i.e, nonunitary case. Like the lattice factorization, the decomposition presented here asymptotically reduces the computational complexity of the transform by a factor two. It has other applications, such as the possibility of defining a waveletlike transform that maps integers to integers.
Analytic Zariski structures, predimensions and nonelementary stability
, 2008
"... The notion of an analytic Zariski structure was introduced in [1] by the author and N.Peatfield in a form slightly different from the one presented here. Analytic Zariski generalises the previously known notion of a Zariski structure (see [2] for onedimensional case and [3], [4] for the general def ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
complex ones, called in [5] generalised analytic sets (defined classically on the complex numbers and in the context of rigid analytic geometry). In [1] we assumed that the Zariski structure is compact (or compactifiable), here we drop this assumption (some interesting structures are not compactifiable
NonElementary SpeedUps in Default Reasoning
 Proceedings ECSQARU'97
, 1997
"... . Default logic is one of the most prominent formalizations of commonsense reasoning. It allows "jumping to conclusions" in case that not all relevant information is known. However, theoretical complexity results imply that default logic is (in the worst case) computationally harder than ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
and show that the presence of defaults can tremendously simplify the search of proofs. In particular, we show that certain sequents have only long "classical" proofs, but short proofs can be obtained by using defaults. 1 Introduction In recent years, the complexity of nonmonotonic reasoning
COMPLEXITY HIERARCHIES BEYOND ELEMENTARY
, 2013
"... We introduce a hierarchy of fastgrowing complexity classes and show its suitability for completeness statements of many non elementary problems. This hierarchy allows the classification of many decision problems with a nonelementary complexity, which occur naturally in logic, combinatorics, formal ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
We introduce a hierarchy of fastgrowing complexity classes and show its suitability for completeness statements of many non elementary problems. This hierarchy allows the classification of many decision problems with a nonelementary complexity, which occur naturally in logic, combinatorics
Proceedings of the TwentyThird International Joint Conference on Artificial Intelligence The Complexity of OneAgent Refinement Modal Logic ∗
"... We investigate the complexity of satisfiability for oneagent refinement modal logic (RML), an extension of basic modal logic (ML) obtained by adding refinement quantifiers on structures. RML is known to have the same expressiveness as ML, but the translation of RML into ML is of nonelementary comp ..."
Abstract
 Add to MetaCart
We investigate the complexity of satisfiability for oneagent refinement modal logic (RML), an extension of basic modal logic (ML) obtained by adding refinement quantifiers on structures. RML is known to have the same expressiveness as ML, but the translation of RML into ML is of nonelementary
Dominance Constraints: Algorithms and Complexity
 IN PROCEEDINGS OF THE THIRD CONFERENCE ON LOGICAL ASPECTS OF COMPUTATIONAL LINGUISTICS
, 1998
"... Dominance constraints for finite tree structures are widely used in several areas of computational linguistics including syntax, semantics, and discourse. In this paper, we investigate algorithmic and complexity questions for dominance constraints and their firstorder theory. We present two NP algo ..."
Abstract

Cited by 39 (20 self)
 Add to MetaCart
algorithms performs well in an application to scope underspecification. We also show that the existential fragment of the firstorder theory of dominance constraints is NPcomplete and that the full firstorder theory has nonelementary complexity.
On the Complexity of Bisimulation Problems for Basic Parallel Processes
 In Proc. of ICALP'2000, volume ? of LNCS
, 2000
"... Strong bisimilarity of Basic Parallel Processes (BPP) is decidable, but the best known algorithm has nonelementary complexity [7]. On the other hand, no lower bound for the problem was known. We show that strong bisimilarity of BPP is coNPhard. Weak bisimilarity of BPP is not known to be decidabl ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
Strong bisimilarity of Basic Parallel Processes (BPP) is decidable, but the best known algorithm has nonelementary complexity [7]. On the other hand, no lower bound for the problem was known. We show that strong bisimilarity of BPP is coNPhard. Weak bisimilarity of BPP is not known
Realtime logics: complexity and expressiveness
 INFORMATION AND COMPUTATION
, 1993
"... The theory of the natural numbers with linear order and monadic predicates underlies propositional linear temporal logic. To study temporal logics that are suitable for reasoning about realtime systems, we combine this classical theory of in nite state sequences with a theory of discrete time, via ..."
Abstract

Cited by 252 (16 self)
 Add to MetaCart
allows us to classify a wide variety of realtime logics according to their complexity and expressiveness. Indeed, it follows that most formalisms proposed in the literature cannot be decided. We are, however, able to identify two elementary realtime temporal logics as expressively complete fragments
The complexity of oneagent Refinement Modal Logic
"... Abstract. We investigate the complexity of satisfiability for oneagent Refinement Modal Logic (RML), a known extension of basic modal logic (ML) obtained by adding refinement quantifiers on structures. It is known that RML has the same expressiveness as ML, but the translation of RML into ML is of ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
is of nonelementary complexity, and RML is at least doubly exponentially more succinct than ML. In this paper, we show that RMLsatisfiability is ‘only ’ singly exponentially harder than MLsatisfiability, the latter being a wellknown PSPACEcomplete problem. More precisely, we establish that RML
Results 1  10
of
463