Frontiers in Algorithmics 10th International Workshop, FAW 2016, Qingdao, China, June 30- July 2, 2016, Proceedings /

Frontiers in Algorithmics 10th International Workshop, FAW 2016, Qingdao, China, June 30- July 2, 2016, Proceedings /

.

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Zhu, Daming (Επιμελητής έκδοσης), Bereg, Sergey (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Cham : Springer International Publishing : Imprint: Springer, 2016.
Σειρά:Lecture Notes in Computer Science, 9711
Θέματα:
Computer science.
Data structures (Computer science).
Computers.
Algorithms.
Computer science > Mathematics.
Computer Science.
Algorithm Analysis and Problem Complexity.
Discrete Mathematics in Computer Science.
Computation by Abstract Devices.
Data Structures.
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 02185nam a22005295i 4500
001 978-3-319-39817-4
003 DE-He213
005 20160615021213.0
007 cr nn 008mamaa
008 160526s2016 gw | s |||| 0|eng d
020 |a 9783319398174  |9 978-3-319-39817-4 
024 7 |a 10.1007/978-3-319-39817-4  |2 doi 
040 |d GrThAP 
050 4 |a QA76.9.A43 
072 7 |a UMB  |2 bicssc 
072 7 |a COM051300  |2 bisacsh 
082 0 4 |a 005.1  |2 23 
245 1 0 |a Frontiers in Algorithmics  |h [electronic resource] :  |b 10th International Workshop, FAW 2016, Qingdao, China, June 30- July 2, 2016, Proceedings /  |c edited by Daming Zhu, Sergey Bereg. 
264 1 |a Cham :  |b Springer International Publishing :  |b Imprint: Springer,  |c 2016. 
300 |a XVII, 290 p. 73 illus.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 9711 
505 0 |a Algorithm -- Complexity -- Problem -- Reduction -- NP-complete -- Graph.-Approximation -- Linear programming -- Local search -- Integer programming.-Semidefinite programming -- Parameterized algorithm.-Fixed parameter.-Tra ctability -- Randomness -- Computational Geometry. . 
520 |a  . 
650 0 |a Computer science. 
650 0 |a Data structures (Computer science). 
650 0 |a Computers. 
650 0 |a Algorithms. 
650 0 |a Computer science  |x Mathematics. 
650 1 4 |a Computer Science. 
650 2 4 |a Algorithm Analysis and Problem Complexity. 
650 2 4 |a Discrete Mathematics in Computer Science. 
650 2 4 |a Computation by Abstract Devices. 
650 2 4 |a Data Structures. 
700 1 |a Zhu, Daming.  |e editor. 
700 1 |a Bereg, Sergey.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783319398167 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 9711 
856 4 0 |u http://dx.doi.org/10.1007/978-3-319-39817-4  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645) 

Παρόμοια τεκμήρια