![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp for Publications
export results for "toc:db/journals/cc/cc16.bht:"
@article{DBLP:journals/cc/BeameIS07, author = {Paul Beame and Russell Impagliazzo and Ashish Sabharwal}, title = {The Resolution Complexity of Independent Sets and Vertex Covers in Random Graphs}, journal = {Comput. Complex.}, volume = {16}, number = {3}, pages = {245--297}, year = {2007}, url = {https://doi.org/10.1007/s00037-007-0230-0}, doi = {10.1007/S00037-007-0230-0}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cc/BeameIS07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/BeaudryH07, author = {Martin Beaudry and Markus Holzer}, title = {The Complexity of Tensor Circuit Evaluation}, journal = {Comput. Complex.}, volume = {16}, number = {1}, pages = {60--111}, year = {2007}, url = {https://doi.org/10.1007/s00037-007-0222-0}, doi = {10.1007/S00037-007-0222-0}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cc/BeaudryH07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/DvirS07, author = {Zeev Dvir and Amir Shpilka}, title = {An Improved Analysis of Linear Mergers}, journal = {Comput. Complex.}, volume = {16}, number = {1}, pages = {34--59}, year = {2007}, url = {https://doi.org/10.1007/s00037-007-0223-z}, doi = {10.1007/S00037-007-0223-Z}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cc/DvirS07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/GoldreichV07, author = {Oded Goldreich and Salil P. Vadhan}, title = {Special Issue On Worst-case Versus Average-case Complexity Editors' Foreword}, journal = {Comput. Complex.}, volume = {16}, number = {4}, pages = {325--330}, year = {2007}, url = {https://doi.org/10.1007/s00037-007-0232-y}, doi = {10.1007/S00037-007-0232-Y}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/GoldreichV07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/GuruswamiK07, author = {Venkatesan Guruswami and Valentine Kabanets}, title = {Special Issue "Conference on Computational Complexity 2006" Guest Editors' Foreword}, journal = {Comput. Complex.}, volume = {16}, number = {2}, pages = {113--114}, year = {2007}, url = {https://doi.org/10.1007/s00037-007-0225-x}, doi = {10.1007/S00037-007-0225-X}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/GuruswamiK07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/GutfreundST07, author = {Dan Gutfreund and Ronen Shaltiel and Amnon Ta{-}Shma}, title = {If {NP} Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances}, journal = {Comput. Complex.}, volume = {16}, number = {4}, pages = {412--441}, year = {2007}, url = {https://doi.org/10.1007/s00037-007-0235-8}, doi = {10.1007/S00037-007-0235-8}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/GutfreundST07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/HarshaIKNV07, author = {Prahladh Harsha and Yuval Ishai and Joe Kilian and Kobbi Nissim and Srinivasan Venkatesh}, title = {Communication vs. Computation}, journal = {Comput. Complex.}, volume = {16}, number = {1}, pages = {1--33}, year = {2007}, url = {https://doi.org/10.1007/s00037-007-0224-y}, doi = {10.1007/S00037-007-0224-Y}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/HarshaIKNV07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/KayalS07, author = {Neeraj Kayal and Nitin Saxena}, title = {Polynomial Identity Testing for Depth 3 Circuits}, journal = {Comput. Complex.}, volume = {16}, number = {2}, pages = {115--138}, year = {2007}, url = {https://doi.org/10.1007/s00037-007-0226-9}, doi = {10.1007/S00037-007-0226-9}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/KayalS07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/McKenzieW07, author = {Pierre McKenzie and Klaus W. Wagner}, title = {The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers}, journal = {Comput. Complex.}, volume = {16}, number = {3}, pages = {211--244}, year = {2007}, url = {https://doi.org/10.1007/s00037-007-0229-6}, doi = {10.1007/S00037-007-0229-6}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/McKenzieW07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/MelkebeekP07, author = {Dieter van Melkebeek and Konstantin Pervyshev}, title = {A Generic Time Hierarchy with One Bit of Advice}, journal = {Comput. Complex.}, volume = {16}, number = {2}, pages = {139--179}, year = {2007}, url = {https://doi.org/10.1007/s00037-007-0227-8}, doi = {10.1007/S00037-007-0227-8}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/MelkebeekP07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/Micciancio07, author = {Daniele Micciancio}, title = {Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions}, journal = {Comput. Complex.}, volume = {16}, number = {4}, pages = {365--411}, year = {2007}, url = {https://doi.org/10.1007/s00037-007-0234-9}, doi = {10.1007/S00037-007-0234-9}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/Micciancio07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/Servedio07, author = {Rocco A. Servedio}, title = {Every Linear Threshold Function has a Low-Weight Approximator}, journal = {Comput. Complex.}, volume = {16}, number = {2}, pages = {180--209}, year = {2007}, url = {https://doi.org/10.1007/s00037-007-0228-7}, doi = {10.1007/S00037-007-0228-7}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/Servedio07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/TrevisanV07, author = {Luca Trevisan and Salil P. Vadhan}, title = {Pseudorandomness and Average-Case Complexity Via Uniform Reductions}, journal = {Comput. Complex.}, volume = {16}, number = {4}, pages = {331--364}, year = {2007}, url = {https://doi.org/10.1007/s00037-007-0233-x}, doi = {10.1007/S00037-007-0233-X}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/TrevisanV07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/WegenerW07, author = {Ingo Wegener and Philipp Woelfel}, title = {New Results on the Complexity of the Middle Bit of Multiplication}, journal = {Comput. Complex.}, volume = {16}, number = {3}, pages = {298--323}, year = {2007}, url = {https://doi.org/10.1007/s00037-007-0231-z}, doi = {10.1007/S00037-007-0231-Z}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/WegenerW07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp1.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.