OpenAlex
PricingAboutJobs
Log inGet started
Work

Some Computable Complexity Measures for Binary Sequences

HTML

Year: 1999
Type: book-chapter
Source: Springer eBooks
Parent work: Sequences and their Applications: Proceedings of SETA ’98
DOI: 10.1007/978-1-4471-0551-0_5
Author: Harald Niederreiter
Institution: Austrian Academy of Sciences
Language: English

Topic: Computability, Logic, AI Algorithms
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: binary sequences, linear complexity, linear complexity profile, tree complexity, Kolmogorov complexity, algorithmic complexity

Open Access status: closed
OpenAlex ID: W8529777
FWCI: 10.13
Cites: 46
Cited by: 74
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms
Security