Login / Signup

-Calculus Alternation Depth Hierarchy is infinite over finite planar graphs.

Giovanna D'AgostinoGiacomo Lenzi
Published in: Theor. Comput. Sci. (2018)
Keyphrases
  • planar graphs
  • real numbers
  • depth map
  • dynamic programming
  • least squares
  • finite number