We prove that the complexity of the uniform first-order theory of ground tree rewrite graphs is in ATIME(22 poly(n) , O(n)). Providing a matching lower bound, we show that there is a fixed ground tree rewrite graph whose first-order theory is hard for ATIME(22 poly(n) , poly(n)) with respect to logspace reductions. Finally, we prove that there is a fixed ground tree rewrite graph together with ...

recently tasks, as the basic units of syllabi, and the cognitive complexity, as the criterion for sequencing them, have caught many second language researchers’ attention. this study sought to explore the effect of utilizing the cognitively simple and complex tasks on high- and low-proficient efl iranian writers’ linguistic performance, i.e., fluency, accuracy, lexical complexity, and structura...

evaluative and comparative analysis among educational projects remains an issue for administration, program directors, instructors, and educational institutes. this study reports a fuzzy complexity model for educational projects, which has two primary aspects (technical aspects and transparency aspects). these aspects may not be measured precisely due to uncertain situations. therefore, a fuzzy...

The information-theoretic observables entropy (a measure of disorder), excess entropy (a measure of complexity), and multi-information are used to analyze ground-state spin configurations for disordered and frustrated model systems in two and three dimensions. For both model systems, ground-state spin configurations can be obtained in polynomial time via exact combinatorial optimization algorit...

We have carried out numerical simulations of seismic ground motion radiating from a mega-earthquake whose rupture process is governed by a multi-scale heterogeneous distribution of fracture energy. The observed complexity of the Mw 9.

The prevalent strategy in the topology optimization phase is to select a subset of members existing in an excessively connected truss, called Ground Structure, such that the overall weight or cost is minimized. Although finding a good topology significantly reduces the overall cost, excessive growth of the size of topology space combined with existence of varied types of design variables challe...

this study examined the effects of task complexity on written narrative production under different task complexity conditions by efl learners at different proficiency levels. task complexity was manipulated along robinson’s (2001b) proposed task complexity dimension of here-and-now (simple) vs. there-and-then (complex) in. accordingly, three specific measures of the written narratives were targ...

We obtain a characterization of quantum shape-phase transitions in the terms of complexity measures in the two-dimensional limit of the vibron model based on the spectrum generating algebra U(3). Complexity measures (in terms of the Rényi entropies) have been calculated for different values of the control parameter for the ground state of this model giving sharp signatures of the quantum shape-...

We determine the computational power of preparing Projected Entangled Pair States (PEPS), as well as the complexity of classically simulating them, and generally the complexity of contracting tensor networks. While creating PEPS allows to solve PP problems, the latter two tasks are both proven to be #P-complete. We further show how PEPS can be used to approximate ground states of gapped Hamilto...

An important task in quantum physics is the estimation of local quantities for ground states of local Hamiltonians. Recently, [Ambainis, CCC 2014] defined the complexity class PQMA[log], and motivated its study by showing that the physical task of estimating the expectation value of a local observable against the ground state of a local Hamiltonian is PQMA[log]-complete. In this paper, we conti...