wyszukanych pozycji: 2
![]() |
Arithmetic Circuits: A Survey of Recent Results and Open Questions
ISBN: 9781601984005 / Angielski / Miękka / 2010 / 194 str. Termin realizacji zamówienia: ok. 13-18 dni roboczych. Algebraic complexity theory studies the inherent difficulty of algebraic problems by quantifying the minimal amount of resources required to solve them. The most fundamental questions in algebraic complexity are related to the complexity of arithmetic circuits: providing efficient algorithms for algebraic problems, proving lower bounds on the size and depth of arithmetic circuits, giving efficient deterministic algorithms for polynomial identity testing, and finding efficient reconstruction algorithms for polynomials computed by arithmetic circuits. Arithmetic Circuits: A Survey of Recent...
Algebraic complexity theory studies the inherent difficulty of algebraic problems by quantifying the minimal amount of resources required to solve the...
|
cena:
459,88 zł |
![]() |
Reed-Muller Codes
ISBN: 9781638281443 / Angielski / Miękka / 2023 / 172 str. Termin realizacji zamówienia: ok. 13-18 dni roboczych. Reed-Muller (RM) codes are among the oldest, simplest and perhaps most ubiquitous family of codes. They are used in many areas of coding theory in both electrical engineering and computer science. Yet, many of their important properties are still under investigation. In this monograph the authors consider some of the most recent developments in RM codes that are having major impacts on the design of modern communication systems. These include weight enumerator and the capacity-achieving properties of RM codes, as well as some of the algorithmic developments. In particular, they discuss...
Reed-Muller (RM) codes are among the oldest, simplest and perhaps most ubiquitous family of codes. They are used in many areas of coding theory in bot...
|
cena:
459,88 zł |