Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/cc/cc17.bht:"
download as .bib file
@article{DBLP:journals/cc/ApplebaumIK08,
author = {Benny Applebaum and
Yuval Ishai and
Eyal Kushilevitz},
title = {On Pseudorandom Generators with Linear Stretch in NC\({}^{\mbox{0}}\)},
journal = {Comput. Complex.},
volume = {17},
number = {1},
pages = {38--69},
year = {2008},
url = {https://doi.org/10.1007/s00037-007-0237-6},
doi = {10.1007/S00037-007-0237-6},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/ApplebaumIK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BasuBGL08,
author = {Saugata Basu and
Nayantara Bhatnagar and
Parikshit Gopalan and
Richard J. Lipton},
title = {Polynomials that Sign Represent Parity and Descartes' Rule of Signs},
journal = {Comput. Complex.},
volume = {17},
number = {3},
pages = {377--406},
year = {2008},
url = {https://doi.org/10.1007/s00037-008-0244-2},
doi = {10.1007/S00037-008-0244-2},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BasuBGL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/CaiL08,
author = {Jin{-}yi Cai and
Pinyan Lu},
title = {Basis Collapse in Holographic Algorithms},
journal = {Comput. Complex.},
volume = {17},
number = {2},
pages = {254--281},
year = {2008},
url = {https://doi.org/10.1007/s00037-008-0249-x},
doi = {10.1007/S00037-008-0249-X},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/CaiL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Chen08,
author = {Hubie Chen},
title = {Inverse {NP} Problems},
journal = {Comput. Complex.},
volume = {17},
number = {1},
pages = {94--118},
year = {2008},
url = {https://doi.org/10.1007/s00037-008-0240-6},
doi = {10.1007/S00037-008-0240-6},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Chen08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/CleveSUU08,
author = {Richard Cleve and
William Slofstra and
Falk Unger and
Sarvagya Upadhyay},
title = {Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems},
journal = {Comput. Complex.},
volume = {17},
number = {2},
pages = {282--299},
year = {2008},
url = {https://doi.org/10.1007/s00037-008-0250-4},
doi = {10.1007/S00037-008-0250-4},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/CleveSUU08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/FortnowIKU08,
author = {Lance Fortnow and
Russell Impagliazzo and
Valentine Kabanets and
Christopher Umans},
title = {On the Complexity of Succinct Zero-Sum Games},
journal = {Comput. Complex.},
volume = {17},
number = {3},
pages = {353--376},
year = {2008},
url = {https://doi.org/10.1007/s00037-008-0252-2},
doi = {10.1007/S00037-008-0252-2},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/FortnowIKU08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Goldreich08,
author = {Oded Goldreich},
title = {Preface to the Special Issue from Random'06},
journal = {Comput. Complex.},
volume = {17},
number = {1},
pages = {1--2},
year = {2008},
url = {https://doi.org/10.1007/s00037-007-0236-7},
doi = {10.1007/S00037-007-0236-7},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Goldreich08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Grigoriev08,
author = {Dima Grigoriev},
title = {Probabilistic Communication Complexity Over The Reals},
journal = {Comput. Complex.},
volume = {17},
number = {4},
pages = {536--548},
year = {2008},
url = {https://doi.org/10.1007/s00037-008-0255-z},
doi = {10.1007/S00037-008-0255-Z},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Grigoriev08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GuL08,
author = {Xiaoyang Gu and
Jack H. Lutz},
title = {Dimension Characterizations of Complexity Classes},
journal = {Comput. Complex.},
volume = {17},
number = {4},
pages = {459--474},
year = {2008},
url = {https://doi.org/10.1007/s00037-008-0257-x},
doi = {10.1007/S00037-008-0257-X},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GuL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GuruswamiK08,
author = {Venkatesan Guruswami and
Valentine Kabanets},
title = {Hardness Amplification via Space-Efficient Direct Products},
journal = {Comput. Complex.},
volume = {17},
number = {4},
pages = {475--500},
year = {2008},
url = {https://doi.org/10.1007/s00037-008-0253-1},
doi = {10.1007/S00037-008-0253-1},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GuruswamiK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Hastad08,
author = {Johan H{\aa}stad},
title = {Every 2-csp Allows Nontrivial Approximation},
journal = {Comput. Complex.},
volume = {17},
number = {4},
pages = {549--566},
year = {2008},
url = {https://doi.org/10.1007/s00037-008-0256-y},
doi = {10.1007/S00037-008-0256-Y},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Hastad08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Healy08,
author = {Alexander Healy},
title = {Randomness-Efficient Sampling within NC\({}^{\mbox{1}}\)},
journal = {Comput. Complex.},
volume = {17},
number = {1},
pages = {3--37},
year = {2008},
url = {https://doi.org/10.1007/s00037-007-0238-5},
doi = {10.1007/S00037-007-0238-5},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Healy08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/HitchcockP08,
author = {John M. Hitchcock and
Aduri Pavan},
title = {Hardness Hypotheses, Derandomization, and Circuit Complexity},
journal = {Comput. Complex.},
volume = {17},
number = {1},
pages = {119--146},
year = {2008},
url = {https://doi.org/10.1007/s00037-008-0241-5},
doi = {10.1007/S00037-008-0241-5},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/HitchcockP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/LachishNS08,
author = {Oded Lachish and
Ilan Newman and
Asaf Shapira},
title = {Space Complexity Vs. Query Complexity},
journal = {Comput. Complex.},
volume = {17},
number = {1},
pages = {70--93},
year = {2008},
url = {https://doi.org/10.1007/s00037-008-0239-z},
doi = {10.1007/S00037-008-0239-Z},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/LachishNS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Miltersen08,
author = {Peter Bro Miltersen},
title = {Special Issue: "Conference on Computational Complexity 2007" Guest
Editor's Foreword},
journal = {Comput. Complex.},
volume = {17},
number = {2},
pages = {147--148},
year = {2008},
url = {https://doi.org/10.1007/s00037-008-0247-z},
doi = {10.1007/S00037-008-0247-Z},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Miltersen08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/PavanV08,
author = {Aduri Pavan and
N. V. Vinodchandran},
title = {2-Local Random Reductions to 3-Valued Functions},
journal = {Comput. Complex.},
volume = {17},
number = {4},
pages = {501--514},
year = {2008},
url = {https://doi.org/10.1007/s00037-008-0245-1},
doi = {10.1007/S00037-008-0245-1},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/PavanV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Peikert08,
author = {Chris Peikert},
title = {Limits on the Hardness of Lattice Problems in \emph{l}\({}_{\mbox{\emph{p}}}\)
Norms},
journal = {Comput. Complex.},
volume = {17},
number = {2},
pages = {300--351},
year = {2008},
url = {https://doi.org/10.1007/s00037-008-0251-3},
doi = {10.1007/S00037-008-0251-3},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Peikert08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/RazT08,
author = {Ran Raz and
Iddo Tzameret},
title = {The Strength of Multilinear Proofs},
journal = {Comput. Complex.},
volume = {17},
number = {3},
pages = {407--457},
year = {2008},
url = {https://doi.org/10.1007/s00037-008-0246-0},
doi = {10.1007/S00037-008-0246-0},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/RazT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/RazY08,
author = {Ran Raz and
Amir Yehudayoff},
title = {Balancing Syntactically Multilinear Arithmetic Circuits},
journal = {Comput. Complex.},
volume = {17},
number = {4},
pages = {515--535},
year = {2008},
url = {https://doi.org/10.1007/s00037-008-0254-0},
doi = {10.1007/S00037-008-0254-0},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/RazY08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Sherstov08,
author = {Alexander A. Sherstov},
title = {Halfspace Matrices},
journal = {Comput. Complex.},
volume = {17},
number = {2},
pages = {149--178},
year = {2008},
url = {https://doi.org/10.1007/s00037-008-0242-4},
doi = {10.1007/S00037-008-0242-4},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Sherstov08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Williams08,
author = {R. Ryan Williams},
title = {Time-Space Tradeoffs for Counting {NP} Solutions Modulo Integers},
journal = {Comput. Complex.},
volume = {17},
number = {2},
pages = {179--219},
year = {2008},
url = {https://doi.org/10.1007/s00037-008-0248-y},
doi = {10.1007/S00037-008-0248-Y},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Williams08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Zimand08,
author = {Marius Zimand},
title = {Exposure-Resilient Extractors and the Derandomization of Probabilistic
Sublinear Time},
journal = {Comput. Complex.},
volume = {17},
number = {2},
pages = {220--253},
year = {2008},
url = {https://doi.org/10.1007/s00037-008-0243-3},
doi = {10.1007/S00037-008-0243-3},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Zimand08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
retrieved on 2024-05-06 03:04 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
