Filters








184 Hits in 9.5 sec

Page 3942 of Mathematical Reviews Vol. , Issue 92g [page]

1992 Mathematical Reviews  
Martinez, Average-case analysis of equality of binary trees un- der the BST probability model (pp. 350-359); Jean Néraud, On the subsets of rank two in a free monoid: a fast decision algo- rithm (extended  ...  Euchner, Lattice basis reduction: improved practical algorithms and solv- ing subset sum problems (pp. 68-85); Gyérgy Turan, A survey of some aspects of computational learning theory (extended abstract  ... 

Reference list of indexed articles

1999 Theoretical Computer Science  
Metivier, On recognizable subsets of free partially commutative monoids 58 (1-3) (1988) 201-208 1112. B. Monien and I.H.  ...  Klop, On the consistency of Koomen's fair abstraction . A. Carpi, On unambiguous reductions of monoids of unambiguous relations 51 (I-2) (1987) 215-220 988. J.  ... 
doi:10.1016/s0304-3975(98)00320-x fatcat:bdgg2ekzdjahdo7g2gtwbdye6m

Any-k Algorithms for Enumerating Ranked Answers to Conjunctive Queries [article]

Nikolaos Tziavelis, Wolfgang Gatterbauer, Mirek Riedewald
2022 arXiv   pre-print
In a more careful analysis of combined complexity, we uncover a previously unknown tradeoff between two different any-k algorithms: one has lower complexity when the number of returned results is small  ...  One core insight of our work is that the problem is closely related to the fundamental task of path enumeration in a weighted DAG.  ...  Any opinions, findings, and conclusions or recommendations expressed in this paper are those of the authors and do not necessarily reflect the views of the funding agencies.  ... 
arXiv:2205.05649v1 fatcat:rdp5gymnbvhcxixjwskukkbjze

Cumulative index of volumes 1–50

1988 Theoretical Computer Science  
RYDER, On the decidability of some problems about rational subsets of free partially commutative monoids (Note) , J., J. HUNT and J.  ...  Paige TARLECKI, A., On the existance of free models in abstract algebraic institutions (in: Fundamental Studies) TARSI, M., see N.  ...  WEGENER, I., More on the complexity of slice functions WEGENER, I., see S.  ... 
doi:10.1016/0304-3975(88)90002-3 fatcat:gasluptczbb6bfplioxrtdrlpy

Some aspects of categories in computer science [chapter]

P.J. Scott
2000 Handbook of Algebra  
The rank of an element f 2 B in T B is the rank of the type .  ...  Computation in this setting arises from one of two methods: The traditional method is Gentzen's Cut-Elimination Algorithm, which allows us to take a formal sequent calculus proof and reduce it to cut-free  ...  In particular, in each homset Hom C (X; Y ) there is a zero morphism 0 XY : X ?! Y , the sum of the empty family. Remark 6.12 In a PAMon-category C 1.  ... 
doi:10.1016/s1570-7954(00)80027-3 fatcat:oeaqbcqgzjhuzl2ddangzergr4

Subject index volumes 1–200

1999 Theoretical Computer Science  
in a group, independence of a set of -, 623 generators of a semigroup, 100 groups, 809 rational @power languages, 1024 string languages, 53 1 subset languages, 531 generators of the cone of context-free  ...  rational subsets of a free monoid, 1807 properties, 797 families, commutative -, 447 multiplicity in a -, 227 *-semiring, 1184 semirings, 78, 797, 1472, 1653, 1718. 1803, 1809, 2149,2408.2709,3171,3193  ... 
doi:10.1016/s0304-3975(98)00319-3 fatcat:s22ud3iiqjht7lfbtc3zctk7zm

DEVS-Based Building Blocks and Architectural Patterns for Intelligent Hybrid Cyberphysical System Design

Bernard Zeigler
2021 Information  
As a start in this direction, this paper offers a notional architecture for intelligent hybrid cyberphysical system design and proceeds to focus on the decision layer to consider DEVS models for basic  ...  What is missing for accelerated adoption of DEVS-based methodology for intelligent cyberphysical system design is a set of building blocks and architectural patterns that can be replicated and reused in  ...  Fast Discrete Event Neuron Architectures for Decision Layer We proceed to review the DEVS characterization of neural network models based on discrete rather than continuous abstractions.  ... 
doi:10.3390/info12120531 fatcat:26xx327ndvcybayg3llmgi5psi

Subdirect products of free semigroups and monoids

Ashley Clayton, University, My, Nik Ruškuc
2021
In Chapter 5, we consider the problem of finite generation for fiber products of free semigroups and monoids over a free fiber.  ...  We give a characterisation for finite generation of the fiber product of two free monoids over a finite fiber, and show that this implies finite presentation.  ...  In particular, the authors prove this using subdirect products of two free groups of rank two.  ... 
doi:10.17630/sta/19 fatcat:nyfgpxrrgzhlta7yz2upptzgc4

Practical algorithms for MSO model-checking on tree-decomposable graphs

Alexander Langer, Felix Reidl, Peter Rossmanith, Somnath Sikdar
2014 Computer Science Review  
A straightforward implementation of the algorithm in the proof of Courcelle's Theorem is useless as it runs into space-explosion problems even for small values of treewidth.  ...  A celebrated theorem in this area by Courcelle states that any graph problem expressible in MSO can be solved in linear time on graphs that admit a tree-decomposition of constant width.  ...  Bodlaender [17] defined two classes of graph decision problems and introduced polynomial time algorithms for these problems on graphs with bounded treewidth.  ... 
doi:10.1016/j.cosrev.2014.08.001 fatcat:4eogxn65frdy5hr7syli5qjd5m

Reference list of indexed articles

1995 Theoretical Computer Science  
Aggregate operations In the lnformatlon source tracking method 133 (2) (1994) 421-442 539. J.A. Anderson, SemIretracts of a free monoid 134(1)(1994)3~11 540. D. Beauquier and A.  ...  Codes mcrdulo llrrlte monadic string-rewriting systems 134 (I) (1994) I75 18X in free monoids 134 (1) (1994) 2099223 552. A.  ... 
doi:10.1016/0304-3975(95)80003-4 fatcat:5nnk76aalje5potfoeg7hksbce

Non-polynomial Worst-Case Analysis of Recursive Programs [article]

Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady
2017 arXiv   pre-print
Our second contribution is the synthesis of measure functions in nonpolynomial forms.  ...  Ranking functions are sound and complete for proving termination and worst-case bounds of nonrecursive programs. First, we apply ranking functions to recursion, resulting in measure functions.  ...  Definition 6 (Monoid). Let Γ be a finite subset of some polynomial ring R[x 1 , . . . , x m ] such that all elements of Γ are polynomials of degree 1. The monoid of Γ is defined by: ).  ... 
arXiv:1705.00317v1 fatcat:uprjjsi27razxcfqe4glhftzle

Normal polytopes: between discrete, continuous, and random [article]

Joseph Gubeladze
2022 arXiv   pre-print
The first three sections of this survey represent an updated and much expanded version of the abstract of my talk at FPSAC'2010: new results are incorporated and several concrete conjectures on the interactions  ...  between the three perspectives on normal polytopes in the title are proposed.  ...  Apart of the mathematical collaboration, he implemented general algorithms, resulting from this collaboration, and carried out decisive computer experimentations.  ... 
arXiv:2206.06306v2 fatcat:tjfmj3ed3bfdljnptcpdmkcvky

GraphBLAST: A High-Performance Linear Algebra-based Graph Framework on the GPU [article]

Carl Yang, Aydin Buluc, John D. Owens
2021 arXiv   pre-print
High-performance implementations of graph algorithms are challenging to implement on new parallel hardware such as GPUs because of three challenges: (1) the difficulty of coming up with graph building  ...  Exploiting output sparsity allows users to tell the backend which values of the output in a single vectorized computation they do not want computed.  ...  We would like to acknowledge Collin McCarthy for maintaining the servers the experiments were run on in top shape.  ... 
arXiv:1908.01407v5 fatcat:yiul77hmmnfffnp5snczlu6yiu

Tight Polynomial Worst-Case Bounds for Loop Programs [article]

Amir M. Ben-Amram, Geoff Hamilton
2020 arXiv   pre-print
An important ingredient in the proof is the forest factorization theorem, a strong structural result on homomorphisms into a finite monoid.  ...  This is a complete solution: whenever a polynomial bound exists it will be found. A pleasant surprise is that the algorithm is quite simple; but it relies on some subtle reasoning.  ...  Ben-Amram is grateful for the hospitality at the School of Computing, Dublin City University, where part of this work has been done. The authors also thank the referees for valuable comments.  ... 
arXiv:1906.10047v5 fatcat:x2yb2xaiq5fujhzjwzif7tlmxi

Tight Polynomial Worst-Case Bounds for Loop Programs

Amir M. Ben-Amram, Geoff Hamilton
2019 Logical Methods in Computer Science  
An important ingredient in the proof is the forest factorization theorem, a strong structural result on homomorphisms into a finite monoid.  ...  This is a complete solution: whenever a polynomial bound exists it will be found. A pleasant surprise is that the algorithm is quite simple; but it relies on some subtle reasoning.  ...  Ben-Amram is grateful for the hospitality at the School of Computing, Dublin City University, where part of this work has been done. The authors also thank the referees for valuable comments.  ... 
doi:10.23638/lmcs-16(2:4)2020 fatcat:qlb4waxi7zbetopsyx2pcubq24
« Previous Showing results 1 — 15 out of 184 results