Search Results - parallel complexity classes

Low-complexity bit-parallel systolic Montgomery multipliers for special classes of GF(2/sup m/) by Lee, Chiou-Yng, Horng, Jenn-Shyong, Jou, I-Chang, Lu, Erl-Huei

“… This paper presents a transformation method to implement low-complexity Montgomery multipliers for all-one polynomials and trinomials…”
Get full text

Modular construction of low complexity parallel multipliers for a class of finite fields GF(2/sup m/) by Hasan, M.A., Wang, M., Bhargava, V.K.

“…Structures for parallel multipliers of a class of fields GF(2/sup m/) based on irreducible all one polynomials (AOP…”
Get full text

Low-Complexity Bit-Parallel Multipliers for a Class of Gf(2m) Based on Modified Booth's Algorithm by Lee, C.-Y., Chiou, C.W.

“…This investigation presents an effective algorithm for computing multiplication over a class of GF(2 m…”
Get full text

A New Pebble Game that Characterizes Parallel Complexity Classes by Venkateswaran, H., Tompa, Martin

“…] and is used to characterize two natural parallel complexity classes, namely LOGCFL and ${\text{AC}}^1 $. The characterizations show a fundamental way in which the computations in these two classes differ…”
Get full text

Dyn-FO: A Parallel, Dynamic Complexity Class by Patnaik, Sushant, Immerman, Neil

“…Traditionally, computational complexity has considered only static problems. Classical complexity classes such as NC, P, and NP are defined in terms of the complexity of checking…”
Get full text

New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P by Vitter, Simons

“… In practice, this is not the case. To resolve this paradox, we introduce new complexity classes PC and PC…”
Get full text

Low complexity bit-parallel systolic architecture for computing C+ AB2 over a class of GF(2 m) by Ting, Yeun-Renn, Lu, Erl-Huei, Lee, Jau-Yien

“…This work presents a ringed bit-parallel systolic architecture for computing C+ AB 2 over a class of GF(2 m…”
Get full text

A new pebble game that characterizes parallel complexity classes by Venkateswaran, H., Tompa, Martin

“…] and is used to characterize two natural parallel complexity classes, namely LOGCFL and AG1. The characterizations show a fundamental way in which the computations in these two classes differ…”
Get full text

LOW-COMPLEXITY BIT-PARALLEL MULTIPLIERS FOR A CLASS OF GF(2m ) BASED ON MODIFIED BOOTH’S ALGORITHM by Lee, C.-Y., Chiou, C.W.

“…This investigation presents an effective algorithm for computing multiplication over a class of GF(2m…”
Get full text

Low Complexity Bit-Parallel Multipliers Based on a Class of Irreducible Pentanomials by Imana, J.L., Hermida, R., Tirado, F.

“…In this paper, we consider the design of bit-parallel canonical basis multipliers over the finite field GF(2 m…”
Get full text

Low complexity bit-parallel multipliers for a class of finite fields by Huapeng Wu, Hasan, M.A.

“…New implementations of bit-parallel multipliers for a class of finite fields are proposed…”
Get full text

CHARACTERIZATIONS OF PARALLEL COMPLEXITY CLASSES by VENKATESWARAN, H

“…) the two players' roles are completely symmetric. The new game is used to study the relationship between two natural parallel complexity classes, namely LOGCFL and AC('1…”
Get full text

Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields by Koc, C.K., Sunar, B.

“…We present a new low-complexity bit-parallel canonical basis multiplier for the field GF(2m…”
Get full text

GF(2n) bit-parallel squarer using generalised polynomial basis for new class of irreducible pentanomials by Xiong, Xi, Fan, Haining

“…Explicit formulae and complexities of bit-parallel GF(2n) squarers for a new class of irreducible pentanomials xn + xn−1 + xk + x…”
Get full text

New classes for parallel complexity: a study of unification and other complete problems for #7B-P by VITTER, J. S, SIMONS, R. A

Get full text

Parallel tractability of ontology materialization: Technique and practice by Zhou, Zhangquan, Qi, Guilin, Glimm, Birte

“…, the theoretical complexity class for parallel tractability. This motivates us to study the problem of parallel tractability of ontology materialization from a theoretical perspective…”
Get full text

Complexity-based parallel rule induction for multiclass classification by Asadi, Shahrokh, Shahrabi, Jamal

“…To classify multiclass classification problems in RIPPER, classes are first sorted according to the increasing order of their prior probabilities…”
Get full text

Modular construction of low complexity parallel multipliers for a class of finite fields GF(2m): Computer arithmetic by HASAN, M. A, MUZHONG WANG, BHARGAVA, V. K

Get full text

Low Complexity Bit-Parallel Multiplier for a Class of Finite Fields by Huapeng Wu

“…This short paper summarizes our recent results on construction of low-complexity bit-parallel finite field multiplier using polynomial basis…”
Get full text

Real-Time Risk Assessment Detection for Weak People by Parallel Training Logical Execution of a Supervised Learning System Based on an IoT Wearable MEMS Accelerometer by Hoang, Minh Long, Nkembi, Armel Asongu, Pham, Phuong Ly

“… other. The PTLE system trains several models in parallel with more specific activity classes in each dataset…”
Get full text