Stack Exchange
sign up
|
log in
|
Theoretical Computer Science
Questions
Tags
Tour
Users
Ask Question
Badge
Editor
First edit.
joachim earned this badge
nov 21 at 19:00
Least fixed point logic is efficiently $\operatorname{P}$-bounded for $\operatorname{P} \Leftrightarrow L_\leq$ is a logic for $\operatorname{P}$
Others with this badge
Theoretical Computer Science Stack Exchange works best with JavaScript enabled