Nettsider med emneord «algorithms»

Publisert 18. sep. 2022 12:00
Publisert 6. juli 2018 12:55

The standard implementations for searching with regular expressions (e.g. grep) have exponential behavior on some input. For example, using ``numerical constraints'' it is easy to make grep one-liners that consume over 8 GB of memory. There are polynomial-time algorithms for a subset of regular expressions with numerical constraints. Is it possible to combine the (usually extremely efficient) optimisations and extensions done in grep with algorithms that do not have exponential behavior?

Publisert 11. feb. 2011 09:51

The Reliable Systems group PSY (formerly PMA) teaches the following courses:

Publisert 4. nov. 2010 14:15
Publisert 4. nov. 2010 14:08
Publisert 4. nov. 2010 14:08
Publisert 4. nov. 2010 13:45