Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/cc/cc33.bht:"
@article{DBLP:journals/cc/AvrahamY24, author = {Daniel Avraham and Amir Yehudayoff}, title = {On Blocky Ranks Of Matrices}, journal = {Comput. Complex.}, volume = {33}, number = {1}, pages = {2}, year = {2024}, url = {https://doi.org/10.1007/s00037-024-00248-1}, doi = {10.1007/S00037-024-00248-1}, timestamp = {Sat, 08 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cc/AvrahamY24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/BencsHR24, author = {Ferenc Bencs and Jeroen Huijben and Guus Regts}, title = {Approximating the chromatic polynomial is as hard as computing it exactly}, journal = {Comput. Complex.}, volume = {33}, number = {1}, pages = {1}, year = {2024}, url = {https://doi.org/10.1007/s00037-023-00247-8}, doi = {10.1007/S00037-023-00247-8}, timestamp = {Fri, 08 Mar 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/BencsHR24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/Chen24, author = {Hubie Chen}, title = {Algebraic Global Gadgetry for Surjective Constraint Satisfaction}, journal = {Comput. Complex.}, volume = {33}, number = {1}, pages = {7}, year = {2024}, url = {https://doi.org/10.1007/s00037-024-00253-4}, doi = {10.1007/S00037-024-00253-4}, timestamp = {Mon, 10 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cc/Chen24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/DuttaST24, author = {Pranjal Dutta and Nitin Saxena and Thomas Thierauf}, title = {Weighted Sum-of-Squares Lower Bounds for Univariate Polynomials Imply {VP} {\(\not =\)}q {VNP}}, journal = {Comput. Complex.}, volume = {33}, number = {1}, pages = {3}, year = {2024}, url = {https://doi.org/10.1007/s00037-024-00249-0}, doi = {10.1007/S00037-024-00249-0}, timestamp = {Sat, 08 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cc/DuttaST24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/FilmusIKK24, author = {Yuval Filmus and Yuval Ishai and Avi Kaplan and Guy Kindler}, title = {Limits of Preprocessing}, journal = {Comput. Complex.}, volume = {33}, number = {1}, pages = {5}, year = {2024}, url = {https://doi.org/10.1007/s00037-024-00251-6}, doi = {10.1007/S00037-024-00251-6}, timestamp = {Mon, 10 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cc/FilmusIKK24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/RezendeMNPR24, author = {Susanna F. de Rezende and Or Meir and Jakob Nordstr{\"{o}}m and Toniann Pitassi and Robert Robere}, title = {{KRW} Composition Theorems via Lifting}, journal = {Comput. Complex.}, volume = {33}, number = {1}, pages = {4}, year = {2024}, url = {https://doi.org/10.1007/s00037-024-00250-7}, doi = {10.1007/S00037-024-00250-7}, timestamp = {Wed, 08 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cc/RezendeMNPR24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/SingerSV24, author = {Noah G. Singer and Madhu Sudan and Santhoshini Velusamy}, title = {Streaming approximation resistance of every ordering {CSP}}, journal = {Comput. Complex.}, volume = {33}, number = {1}, pages = {6}, year = {2024}, url = {https://doi.org/10.1007/s00037-024-00252-5}, doi = {10.1007/S00037-024-00252-5}, timestamp = {Mon, 10 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cc/SingerSV24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.