|
|
|
|
LEADER |
02200nmm a2200385 u 4500 |
001 |
EB002004759 |
003 |
EBX01000000000000001167660 |
005 |
00000000000000.0 |
007 |
cr||||||||||||||||||||| |
008 |
211103 ||| eng |
020 |
|
|
|a 9783030897161
|
100 |
1 |
|
|a Bell, Paul C.
|e [editor]
|
245 |
0 |
0 |
|a Reachability Problems
|h Elektronische Ressource
|b 15th International Conference, RP 2021, Liverpool, UK, October 25–27, 2021, Proceedings
|c edited by Paul C. Bell, Patrick Totzke, Igor Potapov
|
250 |
|
|
|a 1st ed. 2021
|
260 |
|
|
|a Cham
|b Springer International Publishing
|c 2021, 2021
|
300 |
|
|
|a XVIII, 165 p. 16 illus., 6 illus. in color
|b online resource
|
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.-
|
653 |
|
|
|a Software engineering
|
653 |
|
|
|a Computer science
|
653 |
|
|
|a Software Engineering
|
653 |
|
|
|a Artificial Intelligence
|
653 |
|
|
|a Computer networks
|
653 |
|
|
|a Computer Engineering and Networks
|
653 |
|
|
|a Artificial intelligence
|
653 |
|
|
|a Computer engineering
|
653 |
|
|
|a Theory of Computation
|
700 |
1 |
|
|a Totzke, Patrick
|e [editor]
|
700 |
1 |
|
|a Potapov, Igor
|e [editor]
|
041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
989 |
|
|
|b Springer
|a Springer eBooks 2005-
|
490 |
0 |
|
|a Theoretical Computer Science and General Issues
|
028 |
5 |
0 |
|a 10.1007/978-3-030-89716-1
|
856 |
4 |
0 |
|u https://doi.org/10.1007/978-3-030-89716-1?nosfx=y
|x Verlag
|3 Volltext
|
082 |
0 |
|
|a 40,151
|
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
|