Go to the corresponding LIPIcs Volume Portal 
Gajulapalli, Karthik ; Golovnev, Alexander ; Nagargoje, Satyajeet ; Saraogi, Sidhant
pdfformat: 

@InProceedings{gajulapalli_et_al:LIPIcs.APPROX/RANDOM.2023.65, author = {Gajulapalli, Karthik and Golovnev, Alexander and Nagargoje, Satyajeet and Saraogi, Sidhant}, title = {{Range Avoidance for Constant Depth Circuits: Hardness and Algorithms}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)}, pages = {65:165:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959772969}, ISSN = {18688969}, year = {2023}, volume = {275}, editor = {Megow, Nicole and Smith, Adam}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2023/18890}, URN = {urn:nbn:de:0030drops188901}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.65}, annote = {Keywords: Boolean function analysis, Explicit Constructions, Lowdepth Circuits, Range Avoidance, Matrix Rigidity, Circuit Lower Bounds} }
Keywords:  Boolean function analysis, Explicit Constructions, Lowdepth Circuits, Range Avoidance, Matrix Rigidity, Circuit Lower Bounds  
Collection:  Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)  
Issue Date:  2023  
Date of publication:  04.09.2023 