Results 1 to 10 of about 24,693 (267)
Countdown games, and simulation on (succinct) one-counter nets [PDF]
Logical Methods in Computer Science, 2023 We answer an open complexity question by Hofman, Lasota, Mayr, Totzke (LMCS 2016) for simulation preorder on the class of succinct one-counter nets (i.e., one-counter automata with no zero tests where counter increments and decrements are integers ...
Petr Jancar, Petr Osicka, Zdenek Sawa
doaj +1 more source
Succinct summaries of research methods
Ibérica, 2022 In research writing, one of the challenging questions is about the extent to which methods need to be succinctly summarised in introductory sections. To answer this intriguing question, Swales’ (2004) genre-based analytical framework was used to examine ...
Xianqing Luo, Jason Miin-Hwa Lim
doaj +1 more source
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), 2023 33 pages, 1 figure; in FOCS ...
Tianxiao Li +3 more
openaire +2 more sources
Computing RF Tree Distance over Succinct Representations
Algorithms, 2023 There are several tools available to infer phylogenetic trees, which depict the evolutionary relationships among biological entities such as viral and bacterial strains in infectious outbreaks or cancerous cells in tumor progression trees.
António Pedro Branco +2 more
doaj +1 more source
Compositional Algorithms for Succinct Safety Games [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 We study the synthesis of circuits for succinct safety specifications given in the AIG format. We show how AIG safety specifications can be decomposed automatically into sub specifications.
Romain Brenguier +3 more
doaj +1 more source
AbsSynthe: abstract synthesis from succinct safety specifications [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 In this paper, we describe a synthesis algorithm for safety specifications described as circuits. Our algorithm is based on fixpoint computations, abstraction and refinement, it uses binary decision diagrams as symbolic data structure.
Romain Brenguier +3 more
doaj +1 more source
Paging with Succinct Predictions
CoRR, 2022 Paging is a prototypical problem in the area of online algorithms. It has also played a central role in the development of learning-augmented algorithms -- a recent line of research that aims to ameliorate the shortcomings of classical worst-case analysis by giving algorithms access to predictions.
Antoniadis, Antonios +7 more
openaire +10 more sources
Synthesis of Succinct Systems [PDF]
Journal of Computer and System Sciences, 2012 Synthesis of correct by design systems from specification has recently attracted much attention. The theoretical results imply that this problem is highly intractable, e.g., synthesizing a system is 2EXPTIME-complete for an LTL specification, and EXPTIME-complete for a CTL specification.
John Fearnley +2 more
openaire +3 more sources
The succinctness of first-order logic on linear orders [PDF]
Logical Methods in Computer Science, 2005 Succinctness is a natural measure for comparing the strength of different logics. Intuitively, a logic L_1 is more succinct than another logic L_2 if all properties that can be expressed in L_2 can be expressed in L_1 by formulas of (approximately) the ...
Martin Grohe, Nicole Schweikardt
doaj +1 more source
Algorithmica, 2022 AbstractWe present a succinct data structure for permutation graphs, and their superclass of circular permutation graphs, i.e., data structures using optimal space up to lower order terms. Unlike concurrent work on circle graphs (Acan et al. in Theor Comput Sci, https://doi.org/10.1016/j.tcs.2022.06.022, 2022), our data structure also supports distance
Konstantinos Tsakalidis +2 more
openaire +3 more sources