Low Complexity Normal Bases

doi 10.22215/etd/2007-07485
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

Carleton University

Related search

Fast Weighted Universal Transform Coding: Toward Optimal, Low Complexity Bases for Image Compression

English

On the Complexity of Gröbner Bases Conversion

Journal of Symbolic Computation
Computational MathematicsNumber TheoryAlgebra
1999English

Cyclic Galois Extensions and Normal Bases

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1991English

Complexity Management Methodology for Fuzzy Systems With Feedback Rule Bases

Journal of Intelligent and Fuzzy Systems
EngineeringStatisticsProbabilityArtificial Intelligence
2014English

Normal Bases for Non-Archimedean Spaces of Continuous Functions

Publicacions Matematiques
Mathematics
1993English

Sharper Complexity Bounds for Zero-Dimensional Gröbner Bases and Polynomial System Solving

International Journal of Algebra and Computation
Mathematics
2011English

Low-Complexity Precoding for Spatial Modulation

2017English

Small PCPs With Low Query Complexity

Computational Complexity
MathematicsComputational MathematicsTheoretical Computer ScienceComputational Theory
2000English

A Low Complexity Intrusion Detection Algorithm

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2007English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy