Greedy-Like Algorithms in Modal Kleene Algebra

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-24771-5_18
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Kleene Algebra With Hypotheses

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

Towards Interactive Verification of Programmable Logic Controllers Using Modal Kleene Algebra and KIV

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

Beware Greedy Algorithms

Journal of Animal Ecology
EvolutionEcologySystematicsAnimal ScienceBehaviorZoology
2019English

Certification of Compiler Optimizations Using Kleene Algebra With Tests

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2000English

A Cut-Free Cyclic Proof System for Kleene Algebra

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2017English

Simultaneous Approximation by Greedy Algorithms

Advances in Computational Mathematics
Computational MathematicsApplied Mathematics
2006English

A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events

English

Greedy Algorithms for Optimizing Multivariate Horner Schemes

ACM SIGSAM Bulletin
2004English

Fast Greedy Algorithms for Constructing Sparse Geometric Spanners

SIAM Journal on Computing
MathematicsComputer Science
2002English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy