![](https://dblp.uni-trier.de./img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de./img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de./img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Search dblp for Publications
export results for "toc:db/journals/cc/cc23.bht:"
@article{DBLP:journals/cc/0001KQ14, author = {Ankit Gupta and Neeraj Kayal and Youming Qiao}, title = {Random arithmetic formulas can be reconstructed efficiently}, journal = {Comput. Complex.}, volume = {23}, number = {2}, pages = {207--303}, year = {2014}, url = {https://doi.org/10.1007/s00037-014-0085-0}, doi = {10.1007/S00037-014-0085-0}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/0001KQ14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/AmbainisW14, author = {Andris Ambainis and Ronald de Wolf}, title = {How Low can Approximate Degree and Quantum Query Complexity be for Total Boolean Functions?}, journal = {Comput. Complex.}, volume = {23}, number = {2}, pages = {305--322}, year = {2014}, url = {https://doi.org/10.1007/s00037-014-0083-2}, doi = {10.1007/S00037-014-0083-2}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/AmbainisW14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/ArtemenkoS14, author = {Sergei Artemenko and Ronen Shaltiel}, title = {Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification}, journal = {Comput. Complex.}, volume = {23}, number = {1}, pages = {43--83}, year = {2014}, url = {https://doi.org/10.1007/s00037-012-0056-2}, doi = {10.1007/S00037-012-0056-2}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/ArtemenkoS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/BeimelDKW14, author = {Amos Beimel and Sebastian Ben Daniel and Eyal Kushilevitz and Enav Weinreb}, title = {Choosing, Agreeing, and Eliminating in Communication Complexity}, journal = {Comput. Complex.}, volume = {23}, number = {1}, pages = {1--42}, year = {2014}, url = {https://doi.org/10.1007/s00037-013-0075-7}, doi = {10.1007/S00037-013-0075-7}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/BeimelDKW14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/BelovsR14, author = {Aleksandrs Belovs and Ansis Rosmanis}, title = {On the Power of Non-adaptive Learning Graphs}, journal = {Comput. Complex.}, volume = {23}, number = {2}, pages = {323--354}, year = {2014}, url = {https://doi.org/10.1007/s00037-014-0084-1}, doi = {10.1007/S00037-014-0084-1}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/BelovsR14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/DavidP14, author = {Matei David and Periklis A. Papakonstantinou}, title = {Tradeoff lower lounds for stack machines}, journal = {Comput. Complex.}, volume = {23}, number = {1}, pages = {99--146}, year = {2014}, url = {https://doi.org/10.1007/s00037-012-0057-1}, doi = {10.1007/S00037-012-0057-1}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/DavidP14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/DvirKL14, author = {Zeev Dvir and J{\'{a}}nos Koll{\'{a}}r and Shachar Lovett}, title = {Variety Evasive Sets}, journal = {Comput. Complex.}, volume = {23}, number = {4}, pages = {509--529}, year = {2014}, url = {https://doi.org/10.1007/s00037-013-0073-9}, doi = {10.1007/S00037-013-0073-9}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cc/DvirKL14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/GarvinSTV14, author = {Brady Garvin and Derrick Stolee and Raghunath Tewari and N. V. Vinodchandran}, title = {ReachFewL = ReachUL}, journal = {Comput. Complex.}, volume = {23}, number = {1}, pages = {85--98}, year = {2014}, url = {https://doi.org/10.1007/s00037-012-0050-8}, doi = {10.1007/S00037-012-0050-8}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/GarvinSTV14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/Kane14, author = {Daniel M. Kane}, title = {The correct exponent for the Gotsman-Linial Conjecture}, journal = {Comput. Complex.}, volume = {23}, number = {2}, pages = {151--175}, year = {2014}, url = {https://doi.org/10.1007/s00037-014-0086-z}, doi = {10.1007/S00037-014-0086-Z}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/Kane14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/KumarLPS14, author = {Abhinav Kumar and Satyanarayana V. Lokam and Vijay M. Patankar and Jayalal Sarma}, title = {Using Elimination Theory to Construct Rigid Matrices}, journal = {Comput. Complex.}, volume = {23}, number = {4}, pages = {531--563}, year = {2014}, url = {https://doi.org/10.1007/s00037-013-0061-0}, doi = {10.1007/S00037-013-0061-0}, timestamp = {Tue, 19 Mar 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/KumarLPS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/MacielNP14, author = {Alexis Maciel and Phuong Nguyen and Toniann Pitassi}, title = {Lifting lower bounds for tree-like proofs}, journal = {Comput. Complex.}, volume = {23}, number = {4}, pages = {585--636}, year = {2014}, url = {https://doi.org/10.1007/s00037-013-0064-x}, doi = {10.1007/S00037-013-0064-X}, timestamp = {Thu, 22 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cc/MacielNP14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/Meir14, author = {Or Meir}, title = {Combinatorial PCPs with Efficient Verifiers}, journal = {Comput. Complex.}, volume = {23}, number = {3}, pages = {355--478}, year = {2014}, url = {https://doi.org/10.1007/s00037-014-0080-5}, doi = {10.1007/S00037-014-0080-5}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/Meir14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/MundhenkW14, author = {Martin Mundhenk and Felix Weiss}, title = {An {AC} 1-complete model checking problem for intuitionistic logic}, journal = {Comput. Complex.}, volume = {23}, number = {4}, pages = {637--669}, year = {2014}, url = {https://doi.org/10.1007/s00037-013-0062-z}, doi = {10.1007/S00037-013-0062-Z}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/MundhenkW14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/SanthanamW14, author = {Rahul Santhanam and Ryan Williams}, title = {On Uniformity and Circuit Lower Bounds}, journal = {Comput. Complex.}, volume = {23}, number = {2}, pages = {177--205}, year = {2014}, url = {https://doi.org/10.1007/s00037-014-0087-y}, doi = {10.1007/S00037-014-0087-Y}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/SanthanamW14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/Teutsch14, author = {Jason Teutsch}, title = {Short lists for shortest descriptions in short time}, journal = {Comput. Complex.}, volume = {23}, number = {4}, pages = {565--583}, year = {2014}, url = {https://doi.org/10.1007/s00037-014-0090-3}, doi = {10.1007/S00037-014-0090-3}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/Teutsch14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/Umans14, author = {Christopher Umans}, title = {Special Issue "Conference on Computational Complexity 2013" Guest editor's foreword}, journal = {Comput. Complex.}, volume = {23}, number = {2}, pages = {147--149}, year = {2014}, url = {https://doi.org/10.1007/s00037-014-0088-x}, doi = {10.1007/S00037-014-0088-X}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/Umans14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/Viola14, author = {Emanuele Viola}, title = {Randomness Buys Depth for Approximate Counting}, journal = {Comput. Complex.}, volume = {23}, number = {3}, pages = {479--508}, year = {2014}, url = {https://doi.org/10.1007/s00037-013-0076-6}, doi = {10.1007/S00037-013-0076-6}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/Viola14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
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.