default search action

combined dblp search
author search
venue search
publication search

ask others

"Polynomial-Time Approximability of Constrained Reinforcement Learning."

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

Jeremy McMahan (2025)

> Home

Details and statistics

DOI: —

access: open

type: Conference or Workshop Paper

metadata version: 2026-02-04

- view
  - electronic edition @ mlr.press (open access)
  - electronic edition @ openreview.net (open access)
- export record
  dblp key:
  - conf/icml/McMahan25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icml/McMahan25
Jeremy McMahan:
Polynomial-Time Approximability of Constrained Reinforcement Learning. ICML 2025

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.

last updated on 2026-02-04 17:22 CET by the dblp team

all metadata released as open data under CC0 1.0 license

see also: Terms of Use | Privacy Policy | Imprint

dblp was originally created in 1993 at:

since 2018, dblp has been operated, funded, and maintained by:

Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.