"Inferring Lower Bounds for Runtime Complexity."

Florian Frohn et al. (2015)

> Home

Details and statistics

DOI: 10.4230/LIPICS.RTA.2015.334

access: open

type: Conference or Workshop Paper

metadata version: 2019-09-25

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/rta/FrohnGHAS15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/rta/FrohnGHAS15
Florian Frohn, Jürgen Giesl, Jera Hensel, Cornelius Aschermann, Thomas Ströder:
Inferring Lower Bounds for Runtime Complexity. RTA 2015: 334-349

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.