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/cc1.bht:"
download as .bib file
@article{DBLP:journals/cc/BabaiF91,
author = {L{\'{a}}szl{\'{o}} Babai and
Lance Fortnow},
title = {Arithmetization: {A} New Method in Structural Complexity Theory},
journal = {Comput. Complex.},
volume = {1},
pages = {41--66},
year = {1991},
url = {https://doi.org/10.1007/BF01200057},
doi = {10.1007/BF01200057},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/BabaiF91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BabaiFL91,
author = {L{\'{a}}szl{\'{o}} Babai and
Lance Fortnow and
Carsten Lund},
title = {Non-Deterministic Exponential Time has Two-Prover Interactive Protocols},
journal = {Comput. Complex.},
volume = {1},
pages = {3--40},
year = {1991},
url = {https://doi.org/10.1007/BF01200056},
doi = {10.1007/BF01200056},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/BabaiFL91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Baum91,
author = {Ulrich Baum},
title = {Existence and Efficient Construction of Fast Fourier Transforms on
Supersolvable Groups},
journal = {Comput. Complex.},
volume = {1},
pages = {235--256},
year = {1991},
url = {https://doi.org/10.1007/BF01200062},
doi = {10.1007/BF01200062},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Baum91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BorodinT91,
author = {Allan Borodin and
Prasoon Tiwari},
title = {On the Decidability of Sparse Univariate Polynomial Interpolation},
journal = {Comput. Complex.},
volume = {1},
pages = {67--90},
year = {1991},
url = {https://doi.org/10.1007/BF01200058},
doi = {10.1007/BF01200058},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BorodinT91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BurgisserKL91,
author = {Peter B{\"{u}}rgisser and
Marek Karpinski and
Thomas Lickteig},
title = {Some Computational Problems in Linear Algebra as Hard as Matrix Multiplication},
journal = {Comput. Complex.},
volume = {1},
pages = {131--155},
year = {1991},
url = {https://doi.org/10.1007/BF01272518},
doi = {10.1007/BF01272518},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BurgisserKL91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Cleve91,
author = {Richard Cleve},
title = {Towards Optimal Simulations of Formulas by Bounded-Width Programs},
journal = {Comput. Complex.},
volume = {1},
pages = {91--105},
year = {1991},
url = {https://doi.org/10.1007/BF01200059},
doi = {10.1007/BF01200059},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Cleve91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Eberly91,
author = {Wayne Eberly},
title = {Decomposition of Algebras Over Finite Fields and Number Fields},
journal = {Comput. Complex.},
volume = {1},
pages = {183--210},
year = {1991},
url = {https://doi.org/10.1007/BF01272520},
doi = {10.1007/BF01272520},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Eberly91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Eberly91a,
author = {Wayne Eberly},
title = {Decompositions of Algebras Over {R} and {C}},
journal = {Comput. Complex.},
volume = {1},
pages = {211--234},
year = {1991},
url = {https://doi.org/10.1007/BF01200061},
doi = {10.1007/BF01200061},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Eberly91a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Gathen91,
author = {Joachim von zur Gathen},
title = {Efficient and Optimal Exponentiation in Finite Fields},
journal = {Comput. Complex.},
volume = {1},
pages = {360--394},
year = {1991},
url = {https://doi.org/10.1007/BF01212964},
doi = {10.1007/BF01212964},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Gathen91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/HastadG91,
author = {Johan H{\aa}stad and
Mikael Goldmann},
title = {On the Power of Small-Depth Threshold Circuits},
journal = {Comput. Complex.},
volume = {1},
pages = {113--129},
year = {1991},
url = {https://doi.org/10.1007/BF01272517},
doi = {10.1007/BF01272517},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/HastadG91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/HeimanW91,
author = {Rafi Heiman and
Avi Wigderson},
title = {Randomized {VS.} Deterministic Decision Tree Complexity for Read-Once
Boolean Functions},
journal = {Comput. Complex.},
volume = {1},
pages = {311--329},
year = {1991},
url = {https://doi.org/10.1007/BF01212962},
doi = {10.1007/BF01212962},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/HeimanW91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Hirsch91,
author = {Michael D. Hirsch},
title = {Lower Bounds for the Non-Linear Complexity of Algebraic Computation
Trees with Integer Inputs},
journal = {Comput. Complex.},
volume = {1},
pages = {257--268},
year = {1991},
url = {https://doi.org/10.1007/BF01200063},
doi = {10.1007/BF01200063},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Hirsch91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/KoT91,
author = {Ker{-}I Ko and
Wen{-}Guey Tzeng},
title = {Three Sigmap{\_}2-Complete Problems in Computational Learning Theory},
journal = {Comput. Complex.},
volume = {1},
pages = {269--310},
year = {1991},
url = {https://doi.org/10.1007/BF01200064},
doi = {10.1007/BF01200064},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/KoT91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/McKenziePT91,
author = {Pierre McKenzie and
Pierre P{\'{e}}ladeau and
Denis Th{\'{e}}rien},
title = {NC{\({^1}\)}: The Automata-Theoretic Viewpoint},
journal = {Comput. Complex.},
volume = {1},
pages = {330--359},
year = {1991},
url = {https://doi.org/10.1007/BF01212963},
doi = {10.1007/BF01212963},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/McKenziePT91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Shokrollahi91,
author = {Mohammad Amin Shokrollahi},
title = {On the Rank of Certain Finite Fields},
journal = {Comput. Complex.},
volume = {1},
pages = {157--181},
year = {1991},
url = {https://doi.org/10.1007/BF01272519},
doi = {10.1007/BF01272519},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Shokrollahi91.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-04-24 16:12 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:
