語系:
繁體中文
English
說明(常見問題)
回圖書館首頁
手機版館藏查詢
登入
回首頁
到查詢結果
[ subject:"Decidability (Mathematical logic)" ]
切換:
標籤
|
MARC模式
|
ISBD
Reachability problems = 15th Interna...
~
International Conference on Reachability Problems (2021 :)
FindBook
Google Book
Amazon
博客來
Reachability problems = 15th International Conference, RP 2021, Liverpool, UK, October 25-27, 2021 : proceedings /
紀錄類型:
書目-電子資源 : Monograph/item
正題名/作者:
Reachability problems/ edited by Paul C. Bell, Patrick Totzke, Igor Potapov.
其他題名:
15th International Conference, RP 2021, Liverpool, UK, October 25-27, 2021 : proceedings /
其他題名:
RP 2021
其他作者:
Bell, Paul C.
團體作者:
International Conference on Reachability Problems
出版者:
Cham :Springer International Publishing : : 2021.,
面頁冊數:
xviii, 165 p. :ill. (some col.), digital ;24 cm.
內容註:
Invited Papers -- Quantitative vs. Weighted Automata -- Theorem Proving Using Clausal Resolution: From Past to Present -- Population Protocols: Beyond Runtime Analysis -- Recent Advances on Reachability Problems for Valence Systems (Invited Talk) -- Regular Papers -- Improvements in Unfolding of Colored Petri Nets -- Reachability of weakly nonlinear systems using Carleman linearization -- Continued Fraction approach to Gauss-Reduction theory -- Absent Subsequences in Words -- Minimal Number of Calls in Propositional Protocols -- Reachability Is NP-Complete Even for the Simplest Neural Networks.
Contained By:
Springer Nature eBook
標題:
Computer systems - Congresses. - Verification -
電子資源:
https://doi.org/10.1007/978-3-030-89716-1
ISBN:
9783030897161
Reachability problems = 15th International Conference, RP 2021, Liverpool, UK, October 25-27, 2021 : proceedings /
Reachability problems
15th International Conference, RP 2021, Liverpool, UK, October 25-27, 2021 : proceedings /[electronic resource] :RP 2021edited by Paul C. Bell, Patrick Totzke, Igor Potapov. - Cham :Springer International Publishing :2021. - xviii, 165 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,130350302-9743 ;. - Lecture notes in computer science ;13035..
Invited Papers -- Quantitative vs. Weighted Automata -- Theorem Proving Using Clausal Resolution: From Past to Present -- Population Protocols: Beyond Runtime Analysis -- Recent Advances on Reachability Problems for Valence Systems (Invited Talk) -- Regular Papers -- Improvements in Unfolding of Colored Petri Nets -- Reachability of weakly nonlinear systems using Carleman linearization -- Continued Fraction approach to Gauss-Reduction theory -- Absent Subsequences in Words -- Minimal Number of Calls in Propositional Protocols -- Reachability Is NP-Complete Even for the Simplest Neural Networks.
Chapter 'Recent Advances on Reachability Problems for Valence Systems' is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.
ISBN: 9783030897161
Standard No.: 10.1007/978-3-030-89716-1doiSubjects--Topical Terms:
1002491
Computer systems
--Verification--Congresses.
LC Class. No.: QA76.76.V47 / I58 2021
Dewey Class. No.: 005.14
Reachability problems = 15th International Conference, RP 2021, Liverpool, UK, October 25-27, 2021 : proceedings /
LDR
:02052nmm a2200373 a 4500
001
2253562
003
DE-He213
005
20211025132038.0
006
m d
007
cr nn 008maaau
008
220327s2021 sz s 0 eng d
020
$a
9783030897161
$q
(electronic bk.)
020
$a
9783030897154
$q
(paper)
024
7
$a
10.1007/978-3-030-89716-1
$2
doi
035
$a
978-3-030-89716-1
040
$a
GP
$c
GP
041
0
$a
eng
050
4
$a
QA76.76.V47
$b
I58 2021
072
7
$a
UY
$2
bicssc
072
7
$a
COM014000
$2
bisacsh
072
7
$a
UY
$2
thema
072
7
$a
UYA
$2
thema
082
0 4
$a
005.14
$2
23
090
$a
QA76.76.V47
$b
I61 2021
111
2
$a
International Conference on Reachability Problems
$n
(15th :
$d
2021 :
$c
Liverpool, England)
$3
3521861
245
1 0
$a
Reachability problems
$h
[electronic resource] :
$b
15th International Conference, RP 2021, Liverpool, UK, October 25-27, 2021 : proceedings /
$c
edited by Paul C. Bell, Patrick Totzke, Igor Potapov.
246
3
$a
RP 2021
260
$a
Cham :
$b
Springer International Publishing :
$b
Imprint: Springer,
$c
2021.
300
$a
xviii, 165 p. :
$b
ill. (some col.), digital ;
$c
24 cm.
490
1
$a
Lecture notes in computer science,
$x
0302-9743 ;
$v
13035
490
1
$a
Theoretical computer science and general issues
505
0
$a
Invited Papers -- Quantitative vs. Weighted Automata -- Theorem Proving Using Clausal Resolution: From Past to Present -- Population Protocols: Beyond Runtime Analysis -- Recent Advances on Reachability Problems for Valence Systems (Invited Talk) -- Regular Papers -- Improvements in Unfolding of Colored Petri Nets -- Reachability of weakly nonlinear systems using Carleman linearization -- Continued Fraction approach to Gauss-Reduction theory -- Absent Subsequences in Words -- Minimal Number of Calls in Propositional Protocols -- Reachability Is NP-Complete Even for the Simplest Neural Networks.
520
$a
Chapter 'Recent Advances on Reachability Problems for Valence Systems' is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.
650
0
$a
Computer systems
$x
Verification
$v
Congresses.
$3
1002491
650
0
$a
Decidability (Mathematical logic)
$v
Congresses.
$3
3135781
650
0
$a
Computer science
$x
Mathematics
$x
Congresses.
$3
678603
650
1 4
$a
Theory of Computation.
$3
892514
650
2 4
$a
Artificial Intelligence.
$3
769149
650
2 4
$a
Software Engineering/Programming and Operating Systems.
$3
891214
650
2 4
$a
Computer Systems Organization and Communication Networks.
$3
891212
700
1
$a
Bell, Paul C.
$3
3521862
700
1
$a
Totzke, Patrick.
$3
3521863
700
1
$a
Potapov, Igor.
$3
1244938
710
2
$a
SpringerLink (Online service)
$3
836513
773
0
$t
Springer Nature eBook
830
0
$a
Lecture notes in computer science ;
$v
13035.
$3
3521864
830
0
$a
Theoretical computer science and general issues.
$3
3382501
856
4 0
$u
https://doi.org/10.1007/978-3-030-89716-1
950
$a
Computer Science (SpringerNature-11645)
筆 0 讀者評論
館藏地:
全部
電子資源
出版年:
卷號:
館藏
1 筆 • 頁數 1 •
1
條碼號
典藏地名稱
館藏流通類別
資料類型
索書號
使用類型
借閱狀態
預約狀態
備註欄
附件
W9410084
電子資源
11.線上閱覽_V
電子書
EB QA76.76.V47 I58 2021
一般使用(Normal)
在架
0
1 筆 • 頁數 1 •
1
多媒體
評論
新增評論
分享你的心得
Export
取書館
處理中
...
變更密碼
登入