Lower Bounds for the Linear Complexity of Sequences Over Residue Rings

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-46877-3_16
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

On the Linear Complexity of Hall's Sextic Residue Sequences

IEEE Transactions on Information Theory
Computer Science ApplicationsInformation SystemsLibraryInformation Sciences
2001English

Improved Lower Bounds for Tree-Like Resolution Over Linear Inequalities

English

Lower Bounds on Solutions of Quadratic Polynomials Defined Over Finite Rings

International Journal of Mathematics and Mathematical Sciences
Mathematics
2015English

Some Lower Bounds for the Complexity of Continuation Methods

Journal of Complexity
ControlNumerical AnalysisStatisticsProbabilityAlgebraApplied MathematicsNumber TheoryOptimizationMathematics
1998English

Effective Lower Bounds for Some Linear Forms

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1976English

Property Testing Lower Bounds via Communication Complexity

Computational Complexity
MathematicsComputational MathematicsTheoretical Computer ScienceComputational Theory
2012English

On the Communication Complexity Methodology for Proving Lower Bounds on the Query Complexity of Property Testing

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2020English

Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Efficient Algorithms and Lower Bounds for Robust Linear Regression

2019English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy