نتایج جستجو برای: time complexity

تعداد نتایج: 2080450  

1994
Ashish V. Naik Kenneth W. Regan D. Sivakumar

This paper furthers the study of quasi-linear time complexity initiated by Schnorr [Sch76] and Gurevich and Shelah [GS89]. We show that the fundamental properties of the polynomial-time hierarchy carry over to the quasilinear-time hierarchy. Whereas all previously known versions of the Valiant-Vazirani reduction from NP to parity run in quadratic time, we give a new construction using error-cor...

Journal: :journal of english language studies 0
parviz birjandi professor of applied linguistics, alameh tabatabayi university, tehran, iran somayeh alipour ma in tefl, islamic azad university central tehran branch, iran

the present study was conducted to compare the effect of individual and group pre-task planning on efl learners’ accuracy and complexity in speaking. to fulfill the purpose of the study, 60 intermediate female learners at the first grade of high school were chosen by means of a sample preliminary english test (pet) and randomly divided into two experimental groups of 30 students; the individual...

1995
Jin-yi Cai Alan Selman

We extend Levin's theory of average polynomial time to arbitrary time-bounds in accordance with the following general principles: (1) It essentially agrees with Levin's notion when applied to polynomial time-bounds. (2) If a language L belongs to DTIME(T(n)), for some time-bound T (n), then every distributional problem (L;) is T on the-average. (3) If L does not belong to DTIME(T(n)) almost eve...

Journal: :journal of computer and robotics 0
mohammad reza keyvanpour department of computer engineering, alzahra university, tehran, iran mostafa javideh shamsipoor technical college, tehran, iran mohammad reza ebrahimi islamic azad university, qazvin branch, qazvin, iran

traditional leveraging statistical methods for analyzing today’s large volumes of spatial data have high computational burdens. to eliminate the deficiency, relatively modern data mining techniques have been recently applied in different spatial analysis tasks with the purpose of autonomous knowledge extraction from high-volume spatial data. fortunately, geospatial data is considered a proper s...

Journal: :Electronic Colloquium on Computational Complexity (ECCC) 1995
Jin-Yi Cai Alan L. Selman

We extend Levin's theory of average polynomial time to arbitrary time bounds and prove that average time complexity classes form as ne a hierarchy as do deterministic time complexity classes.

The main purpose of this study is to investigate the relationship between economic complexity and competitiveness using panel data in a sample of 39 emerging countries from 2002 to 2018. The results of the causality test of Dmitresco and Horlin Granger (2012) show a two-way cause between economic complexity and competitiveness. This indicates that the higher complexity of the economy helps coun...

Journal: :Journal of Computer and System Sciences 2021

We propose logical characterizations of problems solvable in deterministic polylogarithmic time (PolylogTime) and space (PolylogSpace). introduce a novel two-sorted logic that separates the elements input domain from bit positions needed to address these elements. prove inflationary partial fixed point variants this capture PolylogTime PolylogSpace, respectively. In course proving our indeed ca...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید