Amazon cover image
Image from Amazon.com

Reachability problems : 15th international conference, RP 2021, Liverpool, UK, October 25-27, 2021 : proceedings / Paul C. Bell, Patrick Totzke, Igor Potapov (eds.).

By: Contributor(s): Material type: TextTextSeries: Lecture notes in computer science ; 13035. | LNCS sublibrary. SL 1, Theoretical computer science and general issues.Publisher: Cham : Springer, [2021]Copyright date: ©2021Description: 1 online resource : illustrations (some color)Content type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783030897161
  • 3030897168
Other title:
  • RP 2021
Subject(s): Genre/Form: Additional physical formats: Print version:: Reachability problems.DDC classification:
  • 005.1/4 23
LOC classification:
  • QA76.76.V47 I58 2021
Online resources:
Contents:
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.-
Summary: 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.
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library eBook LNCS Available
Total holds: 0

International conference proceedings.

Includes author index.

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.

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.-

Online resource; title from PDF title page (SpringerLink, viewed November 4, 2021).

Powered by Koha