Ask
Search
My library

About
Statistics
Contact
Data Protection
Accessibility
Imprint
Changelog
Frontend: v1.31.3
Backend: v1.11.4

We use cookies to provide a better user experience.

Data Protection

The probabilistic theory of the joint linear complexity of multisequences

Niederreiter, H.

Publication date

January 2006

DOI

10.1007/11863854_2

ISSN

0302-9743

Citation count (estimate)

9

Abstract

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)4086 LNCS5-1

Extracted data

Related items

Lecture notes on computational complexity

Luca Trevisan

January 2004

These are scribed notes from a graduate courses on Computational Complexity offered at the Universit...

Algorithmic Information Theory and Kolmogorov Complexity

Shen, Alexander

January 2000

This document contains lecture notes of an introductory course on Kolmogorov complexity. They cover ...

Algorithmic Information Theory and Kolmogorov Complexity

Shen, Alexander

January 2000

This document contains lecture notes of an introductory course on Kolmogorov complexity. They cover ...

Proof of a conjecture on the joint linear complexity profile of multisequences

Niederreiter, H.
Wang, L.-P.

January 2005

10.1007/11596219_2Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial...

Linear complexity and related complexity measures for sequences

Niederreiter, H.

January 2003

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

Periodic sequences with maximal linear complexity and almost maximal k-rrror linear complexity

Niederreiter, H.
Shparlinski, I.E.

January 2003

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

Probability hypothesis density approach for multi-camera multi-object tracking

Pham, N.T.
Huang, W.
Ong, S.H.

January 2007

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

Probabilistic analysis of two complexity measures for linear programming problems

Todd, M. J.
Tuncel, L.
Ye, Y.

October 1998

Probabilistic analysis of two complexity measures for linear programming problem

Absolute versus probabilistic classification in a logical setting

Jain, S.
Martin, E.
Stephan, F.

January 2005

10.1007/11564089_26Lecture Notes in Computer Science (including subseries Lecture Notes in Artificia...

A new probabilistic model for recognizing signs with systematic modulations

Ong, S.C.W.
Ranganath, S.

January 2007

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

Continuous Naive Bayesian classifications

Vega, V.B.
Bressan, S.

January 2003

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

Probabilistic Complexity Classes through Semantics

Seiller, Thomas

January 2020

In a recent paper, the author has shown how Interaction Graphs models for linear logic can be used t...

On the generalized joint linear complexity profile of a class of nonlinear pseudorandom multisequences

Ostafe, Alina
Shparlinski, Igor E
Winterhof, Arne

January 2010

Recently, multisequences have gained increasing interest for applications in cryptography and quasi-...

Probabilistic complexity classes and lowness

Schöning, Uwe

August 1989

AbstractGeneral properties and proof techniques concerning probabilistic complexity classes are disc...

Kolmogorov complexity and the recursion theorem

Kjos-Hanssen, B.
Merkle, W.
Stephan, P.

January 2006

10.1007/11672142_11Lecture Notes in Computer Science (including subseries Lecture Notes in Artificia...

Lecture notes on computational complexity

Luca Trevisan

January 2004

These are scribed notes from a graduate courses on Computational Complexity offered at the Universit...

Algorithmic Information Theory and Kolmogorov Complexity

Shen, Alexander

January 2000

This document contains lecture notes of an introductory course on Kolmogorov complexity. They cover ...

Algorithmic Information Theory and Kolmogorov Complexity

Shen, Alexander

January 2000

This document contains lecture notes of an introductory course on Kolmogorov complexity. They cover ...

Proof of a conjecture on the joint linear complexity profile of multisequences

Niederreiter, H.
Wang, L.-P.

January 2005

10.1007/11596219_2Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial...

Linear complexity and related complexity measures for sequences

Niederreiter, H.

January 2003

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

Periodic sequences with maximal linear complexity and almost maximal k-rrror linear complexity

Niederreiter, H.
Shparlinski, I.E.

January 2003

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

Probability hypothesis density approach for multi-camera multi-object tracking

Pham, N.T.
Huang, W.
Ong, S.H.

January 2007

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

Probabilistic analysis of two complexity measures for linear programming problems

Todd, M. J.
Tuncel, L.
Ye, Y.

October 1998

Probabilistic analysis of two complexity measures for linear programming problem

Absolute versus probabilistic classification in a logical setting

Jain, S.
Martin, E.
Stephan, F.

January 2005

10.1007/11564089_26Lecture Notes in Computer Science (including subseries Lecture Notes in Artificia...

A new probabilistic model for recognizing signs with systematic modulations

Ong, S.C.W.
Ranganath, S.

January 2007

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

Continuous Naive Bayesian classifications

Vega, V.B.
Bressan, S.

January 2003

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

Probabilistic Complexity Classes through Semantics

Seiller, Thomas

January 2020

In a recent paper, the author has shown how Interaction Graphs models for linear logic can be used t...

On the generalized joint linear complexity profile of a class of nonlinear pseudorandom multisequences

Ostafe, Alina
Shparlinski, Igor E
Winterhof, Arne

January 2010

Recently, multisequences have gained increasing interest for applications in cryptography and quasi-...

Probabilistic complexity classes and lowness

Schöning, Uwe

August 1989

AbstractGeneral properties and proof techniques concerning probabilistic complexity classes are disc...

Kolmogorov complexity and the recursion theorem

Kjos-Hanssen, B.
Merkle, W.
Stephan, P.

January 2006

10.1007/11672142_11Lecture Notes in Computer Science (including subseries Lecture Notes in Artificia...

Lecture notes on computational complexity

Luca Trevisan

January 2004

These are scribed notes from a graduate courses on Computational Complexity offered at the Universit...

Algorithmic Information Theory and Kolmogorov Complexity

Shen, Alexander

January 2000

This document contains lecture notes of an introductory course on Kolmogorov complexity. They cover ...

Algorithmic Information Theory and Kolmogorov Complexity

Shen, Alexander

January 2000

This document contains lecture notes of an introductory course on Kolmogorov complexity. They cover ...