000 | 03361nam a22005055i 4500 | ||
---|---|---|---|
001 | 978-3-319-10683-0 | ||
003 | DE-He213 | ||
005 | 20200421111706.0 | ||
007 | cr nn 008mamaa | ||
008 | 150325s2014 gw | s |||| 0|eng d | ||
020 |
_a9783319106830 _9978-3-319-10683-0 |
||
024 | 7 |
_a10.1007/978-3-319-10683-0 _2doi |
|
050 | 4 | _aQA76.9.D35 | |
072 | 7 |
_aUMB _2bicssc |
|
072 | 7 |
_aURY _2bicssc |
|
072 | 7 |
_aCOM031000 _2bisacsh |
|
082 | 0 | 4 |
_a005.74 _223 |
245 | 1 | 0 |
_aOpen Problems in Mathematics and Computational Science _h[electronic resource] / _cedited by �Cetin Kaya Ko�c. |
264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2014. |
|
300 |
_aVIII, 439 p. 91 illus., 12 illus. in color. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
505 | 0 | _aAbout Open Problems -- The Past, Evolving Present, and Future of the Discrete Logarithm -- Isogenies in Theory and Praxis -- Another Look at Security Theorems for 1-Key Nested MACs -- Non-extendable Fq-Quadratic Perfect Nonlinear Maps -- Open Problems for Polynomials over Finite Fields and Applications -- Generating Good Span n Sequences Using Orthogonal Functions in Nonlinear Feedback Shift Registers -- Open Problems on the Crosscorrelation of m-Sequences -- Open Problems on With-Carry Sequence Generators -- Open Problems on Binary Bent Functions -- On Semi-bent functions and Related Plateaued Functions over the Galois field F2n -- True Random Number Generators -- How to Sign Paper Contracts? Conjectures and Evidence Related to Equitable and Efficient Collaborative Task Scheduling -- Theoretical Parallel Computing Models for GPU Computing -- Membrane Computing: Basics and Frontiers -- A Panorama of Post-quantum Cryptography. | |
520 | _aThis book presents interesting, important unsolved problems in the mathematical and computational sciences. The contributing authors are leading researchers in their fields and they explain outstanding challenges in their domains, first by offering basic definitions, explaining the context, and summarizing related algorithms, theorems, and proofs, and then by suggesting creative solutions.   The authors feel a strong motivation to excite deep research and discussion in the mathematical and computational sciences community, and the book will be of value to postgraduate students and researchers in the areas of theoretical computer science, discrete mathematics, engineering, and cryptology. | ||
650 | 0 | _aComputer science. | |
650 | 0 | _aData structures (Computer science). | |
650 | 0 | _aComputers. | |
650 | 0 |
_aComputer science _xMathematics. |
|
650 | 0 | _aComputer mathematics. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aData Structures, Cryptology and Information Theory. |
650 | 2 | 4 | _aTheory of Computation. |
650 | 2 | 4 | _aMathematics of Computing. |
650 | 2 | 4 | _aComputational Mathematics and Numerical Analysis. |
700 | 1 |
_aKo�c, �Cetin Kaya. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783319106823 |
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-3-319-10683-0 |
912 | _aZDB-2-SCS | ||
942 | _cEBK | ||
999 |
_c55266 _d55266 |