Suchergebnisse - Parallel complexity classes

Low-complexity bit-parallel systolic Montgomery multipliers for special classes of GF(2/sup m/) von 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 …”
Volltext

Modular construction of low complexity parallel multipliers for a class of finite fields GF(2/sup m/) von 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 …”
Volltext

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

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

A New Pebble Game that Characterizes Parallel Complexity Classes von 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 …”
Volltext

Dyn-FO: A Parallel, Dynamic Complexity Class von 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 …”
Volltext

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

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

Low complexity bit-parallel systolic architecture for computing C+ AB2 over a class of GF(2 m) von 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 …”
Volltext

A new pebble game that characterizes parallel complexity classes von 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 …”
Volltext

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

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

Low Complexity Bit-Parallel Multipliers Based on a Class of Irreducible Pentanomials von 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 …”
Volltext

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

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

CHARACTERIZATIONS OF PARALLEL COMPLEXITY CLASSES von 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 …”
Volltext

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

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

GF(2n) bit-parallel squarer using generalised polynomial basis for new class of irreducible pentanomials von 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 …”
Volltext

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

Volltext

Parallel tractability of ontology materialization: Technique and practice von 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 …”
Volltext

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

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

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

Volltext

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

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

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 von 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 …”
Volltext