The Satisfiability Problem for a Quantitative Fragment of PCTL (English)
- New search for: Chodil, Miroslav
- New search for: Kucera, Antonin
- New search for: Chodil, Miroslav
- New search for: Kucera, Antonin
In:
Fundamentals of computation theory
; 149-161
;
2021
-
ISBN:
- Conference paper / Print
-
Title:The Satisfiability Problem for a Quantitative Fragment of PCTL
-
Contributors:Chodil, Miroslav ( author ) / Kucera, Antonin ( author )
-
Conference:FCT ; 23. ; 2021 ; Online
-
Published in:Fundamentals of computation theory ; 149-161
-
Publisher:
- New search for: Springer
-
Place of publication:Cham, Switzerland
-
Publication date:2021
-
ISBN:
-
Type of media:Conference paper
-
Type of material:Print
-
Language:English
- New search for: 54.10
- Further information on Basic classification
-
Keywords:
-
Classification:
BKL: 54.10 Theoretische Informatik -
Source:
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 3
-
Two-Sided Matching Markets with Strongly Correlated PreferencesGimbert, Hugo / Mathieu, Claire / Mauras, Simon et al. | 2021
- 18
-
Communicating Finite State Machines and an Extensible Toolchain for Multiparty Session TypesYoshida, Nobuko / Zhou, Fangyi / Ferreira, Francisco et al. | 2021
- 39
-
First-Order Logic and Its Infinitary Quantifier Extensions over Countable WordsAdsul, Bharat / Sarkar, Saptarshi / Sreejith, A. V. et al. | 2021
- 53
-
From Symmetry to Asymmetry: Generalizing TSP Approximations by ParametrizationLöser,, Lukas Behrendt, Katrin Casel, Tobias Friedrich, J. A. Gregor Lagodzinski, Alexander / Wilhelm, Marcus et al. | 2021
- 67
-
A. Poly-log Competitive Posted-Price Algorithm for Online Metrical Matching on a SpiderBender, Max / Gilbert, Jacob / Pruhs, Kirk et al. | 2021
- 85
-
Computational Complexity of Covering Disconnected MultigraphsBok, Jan / Fiala, Jiri / Jedlickova, Nikola / Kratochvil, Jan / Seifrtovda, Michaela et al. | 2021
- 100
-
The Complexity of Bicriteria Tree-DepthBorowiecki, Piotr / Dereniowski, Dariusz / Osula, Dorota et al. | 2021
- 114
-
TS-Reconfiguration of Dominating Sets in Circle and Circular-Arc GraphsBousquet, Nicolas / Joffard, Alice et al. | 2021
- 135
-
Bipartite 3-Regular Counting Problems with Mixed SignsCai, Jin-Yi / Fan, Austen Z. / Liu, Yin et al. | 2021
- 149
-
The Satisfiability Problem for a Quantitative Fragment of PCTLChodil, Miroslav / Kucera, Antonin et al. | 2021
- 162
-
Beyond the BEST Theorem: Fast Assessment of Eulerian TrailsConte, Alessio / Grossi, Roberto / Loukides, Grigorios / Pisanti, Nadia / Pissis, Solon P. / Punzi, Giulia et al. | 2021
- 176
-
Linear-Time Minimal Cograph EditingCrespelle, Christophe et al. | 2021
- 190
-
Regular Model Checking with Regular RelationsDave, Vrunda / Dohmen, Taylor / Krishna, Shankara Narayanan / Trivedi, Ashutosh et al. | 2021
- 204
-
Minimum Consistent Subset Problem for TreesDey, Sanjana / Maheshwari, Anil / Nandy, Subhas C. et al. | 2021
- 217
-
Parameterized Complexity of Finding Subgraphs with Hereditary Properties on Hereditary Graph ClassesEppstein, David / Gupta, Siddharth / Havvaei, Elham et al. | 2021
- 230
-
The Space Complexity of Sum LabellingFernau, Henning / Gajjar, Kshitij et al. | 2021
- 245
-
On Minimizing Regular Expressions Without Kleene StarGruber, Hermann / Holzer, Markus / Wolfsteiner, Simon et al. | 2021
- 259
-
Computational Complexity of Computing a Quasi-Proper EquilibriumHansen, Kristoffer Arnsfelt / Lund, Troels Bjerre et al. | 2021
- 272
-
Computational Complexity of Synchronization Under Sparse Regular ConstraintsHoffmann, Stefan et al. | 2021
- 287
-
On Dasgupta’s Hierarchical Clustering Objective and Its Relation to Other Graph ParametersHogemo, Svein / Bergougnoux, Benjamin / Brandes, Ulrik / Paul, Christophe / Telle, Jan Arne et al. | 2021
- 301
-
Mengerian Temporal Graphs RevisitedIbiapina, Allen / Silva, Ana et al. | 2021
- 314
-
Faster FPT Algorithms for Deletion to Pairs of Graph ClassesJacob, Ashwin / Majumdar, Diptapriyo / Raman, Venkatesh et al. | 2021
- 327
-
Fast Algorithms for the Rooted Triplet Distance Between CaterpillarsJansson, Jesper / Lee, Wing Lik et al. | 2021
- 341
-
Deciding Top-Down Determinism of Regular Tree LanguagesLeupold, Peter / Maneth, Sebastian et al. | 2021
- 354
-
Propositional Gossip ProtocolsLivesey, Joseph / Wojtczak, Dominik et al. | 2021
- 371
-
Complexity of Word Problems for HNN-ExtensionsLohrey, Markus et al. | 2021
- 385
-
On Finding Separators in Temporal Split and Permutation GraphsMaack, Nicolas / Molter, Hendrik / Niedermeier, Rolf / Renken, Malte et al. | 2021
- 399
-
The Possible Winner Problem with Uncertain Weights Revisited.Neveling, Marc / Rothe, Jörg / Weishaupt, Robin et al. | 2021
- 413
-
Streaming Deletion Problems Parameterized by Vertex CoverOostveen, Jelle J. / Jan, Erik / Leeuwen, van et al. | 2021
- 427
-
On the Hardness of the Determinant: Sum of Regular Set-Multilinear CircuitsRaja, S. / V., G. / Bharadwaj, Sumukha et al. | 2021
- 440
-
Concentration of the Collision EstimatorSkorski, Maciej et al. | 2021
- 457
-
Valency-Based Consensus Under Message Adversaries Without Limit-ClosureWinkler, Kyrill / Schmid, Ulrich / Nowak, Thomas et al. | 2021