Results 31 to 40 of about 3,400 (241)
Dynamic Complexity of Parity Exists Queries [PDF]
Logical Methods in Computer Science, 2021 Given a graph whose nodes may be coloured red, the parity of the number of red nodes can easily be maintained with first-order update rules in the dynamic complexity framework DynFO of Patnaik and Immerman.
Nils Vortmeier, Thomas Zeume
doaj +1 more source
The Arity Hierarchy in the Polyadic μ-Calculus [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 The polyadic mu-calculus is a modal fixpoint logic whose formulas define relations of nodes rather than just sets in labelled transition systems. It can express exactly the polynomial-time computable and bisimulation-invariant queries on finite graphs ...
Martin Lange
doaj +1 more source
On the Mints Hierarchy in First-Order Intuitionistic Logic [PDF]
Logical Methods in Computer Science, 2017 We stratify intuitionistic first-order logic over $(\forall,\to)$ into fragments determined by the alternation of positive and negative occurrences of quantifiers (Mints hierarchy). We study the decidability and complexity of these fragments.
Aleksy Schubert +2 more
doaj +1 more source
Polyadic Hopf Algebras and Quantum Groups
East European Journal of Physics, 2021 This article continues the study of concrete algebra-like structures in our polyadic approach, where the arities of all operations are initially taken as arbitrary, but the relations between them, the arity shapes, are to be found from some natural ...
S. Duplij
doaj +1 more source
The Mask of Odd Points n-Ary Interpolating Subdivision Scheme
Journal of Applied Mathematics, 2012 We present an explicit formula for the mask of odd points n-ary, for any odd n⩾3, interpolating subdivision schemes. This formula provides the mask of lower and higher arity schemes. The 3-point and 5-point a-ary schemes introduced by Lian, 2008, and (2m+
Ghulam Mustafa +3 more
doaj +1 more source
Essential Arity Gap of Boolean Functions [PDF]
, 2008 In this paper we investigate the Boolean functions with maximum essential arity gap. Additionally we propose a simpler proof of an important theorem proved by M. Couceiro and E. Lehtonen in [3].
Shtrakov, Slavcho
core +1 more source
Some simple varieties of trees arising in permutation analysis [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 After extending classical results on simple varieties of trees to trees counted by their number of leaves, we describe a filtration of the set of permutations based on their strong interval trees.
Mathilde Bouvel +2 more
doaj +1 more source
, 2012 Mean (standard error) response error rates and times (ms) for each arity condition.
Yuji Takeda (178444) +2 more
core +1 more source
AxiomsThis article develops a comprehensive theory of multiary graded polyadic algebras, extending the classical concept of group-graded algebras to higher-arity structures.
Steven Duplij
doaj +1 more source
Aging and Cancer, EarlyView.Cancer treatment is associated with measurable acceleration of biological aging across epigenetic, telomere, senescence, and immune biomarkers. However, biomarker validation and interventional strategies remain limited, especially in hematologic malignancies, underscoring the need for standardized multi‐omic aging assessments and adequately powered ...
Moataz Ellithi +3 more
wiley +1 more source