Go to the corresponding LIPIcs Volume Portal 
Göös, Mika ; Kamath, Pritish ; Sotiraki, Katerina ; Zampetakis, Manolis
pdfformat: 

@InProceedings{gs_et_al:LIPIcs:2020:12571, author = {Mika G{\"o}{\"o}s and Pritish Kamath and Katerina Sotiraki and Manolis Zampetakis}, title = {{On the Complexity of Moduloq Arguments and the Chevalley  Warning Theorem}}, booktitle = {35th Computational Complexity Conference (CCC 2020)}, pages = {19:119:42}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959771566}, ISSN = {18688969}, year = {2020}, volume = {169}, editor = {Shubhangi Saraf}, publisher = {Schloss DagstuhlLeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2020/12571}, URN = {urn:nbn:de:0030drops125712}, doi = {10.4230/LIPIcs.CCC.2020.19}, annote = {Keywords: Total NP Search Problems, Moduloq arguments, Chevalley  Warning Theorem} }
Keywords:  Total NP Search Problems, Moduloq arguments, Chevalley  Warning Theorem  
Collection:  35th Computational Complexity Conference (CCC 2020)  
Issue Date:  2020  
Date of publication:  17.07.2020 