東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Linked to FindBook

Google Book

Amazon

博客來

Computability and complexity = foundations and tools for pursuing scientific applications /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Computability and complexity/ by Rod Downey.
Reminder of title:	foundations and tools for pursuing scientific applications /
Author:	Downey, Rod.
Published:	Cham :Springer Nature Switzerland : : 2024.,
Description:	xxviii, 346 p. :ill., digital ;24 cm.
[NT 15003449]:	Introduction -- Some Naive Set Theory -- Regular Languages and Finite Automata -- General Models of Computation -- Deeper Computability -- Computational Complexity -- NP- and PSPACE-Completeness -- Some Structural Complexity -- Parameterized Complexity -- Average Case, Smoothed Analysis, and Generic Case -- Complexity -- References.
Contained By:	Springer Nature eBook
Subject:	Computer science - Mathematics. -
Online resource:	https://doi.org/10.1007/978-3-031-53744-8
ISBN:	9783031537448

Computability and complexity = foundations and tools for pursuing scientific applications /
Downey, Rod.

Computability and complexityfoundations and tools for pursuing scientific applications /[electronic resource] :by Rod Downey. - Cham :Springer Nature Switzerland :2024. - xxviii, 346 p. :ill., digital ;24 cm. - Undergraduate topics in computer science,2197-1781. - Undergraduate topics in computer science..

Introduction -- Some Naive Set Theory -- Regular Languages and Finite Automata -- General Models of Computation -- Deeper Computability -- Computational Complexity -- NP- and PSPACE-Completeness -- Some Structural Complexity -- Parameterized Complexity -- Average Case, Smoothed Analysis, and Generic Case -- Complexity -- References.

ISBN: 9783031537448

Standard No.: 10.1007/978-3-031-53744-8doiSubjects--Topical Terms:

532725
Computer science
--Mathematics.

LC Class. No.: QA76.9.M35

Dewey Class. No.: 004.0151

Computability and complexity = foundations and tools for pursuing scientific applications /
LDR:01390nmm a2200325 a 4500 001 2371215
003 DE-He213
005 20240510124826.0
006 m d
007 cr nn 008maaau
008 241127s2024 sz s 0 eng d
020 $a 9783031537448 $q (electronic bk.)
020 $a 9783031537431 $q (paper)
024 7 $a 10.1007/978-3-031-53744-8 $2 doi
035 $a 978-3-031-53744-8
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.M35
072 7 $a UYA $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a UYA $2 thema
082 0 4 $a 004.0151 $2 23
090 $a QA76.9.M35 $b D748 2024
100 1 $a Downey, Rod. $3 3717072
245 1 0 $a Computability and complexity $h [electronic resource] : $b foundations and tools for pursuing scientific applications / $c by Rod Downey.
260 $a Cham : $b Springer Nature Switzerland : $b Imprint: Springer, $c 2024.
300 $a xxviii, 346 p. : $b ill., digital ; $c 24 cm.
490 1 $a Undergraduate topics in computer science, $x 2197-1781
505 0 $a Introduction -- Some Naive Set Theory -- Regular Languages and Finite Automata -- General Models of Computation -- Deeper Computability -- Computational Complexity -- NP- and PSPACE-Completeness -- Some Structural Complexity -- Parameterized Complexity -- Average Case, Smoothed Analysis, and Generic Case -- Complexity -- References.
650 0 $a Computer science $x Mathematics. $3 532725
650 0 $a Computable functions. $3 559829
650 1 4 $a Theory of Computation. $3 892514
650 2 4 $a Computational Complexity. $3 3538876
650 2 4 $a Computability and Recursion Theory. $3 3602807
650 2 4 $a Computer and Information Systems Applications. $3 3538505
650 2 4 $a Complex Systems. $3 1566441
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Undergraduate topics in computer science. $3 1567579
856 4 0 $u https://doi.org/10.1007/978-3-031-53744-8
950 $a Computer Science (SpringerNature-11645)