@InProceedings{chakraborty_et_al:LIPIcs.APPROX/RANDOM.2024.71,
  author =	{Chakraborty, Sourav and Kayal, Chandrima and Mittal, Rajat and Paraashar, Manaswi and Saurabh, Nitin},
  title =	{{Approximate Degree Composition for Recursive Functions}},
  booktitle =	{Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2024)},
  pages =	{71:1--71:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-348-5},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{317},
  editor =	{Kumar, Amit and Ron-Zewi, Noga},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2024.71},
  URN =		{urn:nbn:de:0030-drops-210642},
  doi =		{10.4230/LIPIcs.APPROX/RANDOM.2024.71},
  annote =	{Keywords: Approximate degree, Boolean function, Composition theorem}
}