default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Complexity, Volume 2
Volume 2, 1992
- Richard Beigel, Joan Feigenbaum:
On Being Incoherent Without Being Very Hard. 1-17 - Judy Goldsmith
, Lane A. Hemachandra, Kenneth Kunen:
Polynomial-Time Compression. 18-39 - James F. Lynch:
The Quantifier Structure of Sentences That Characterize Nondeterministic Time Complexity. 40-66 - Mohammad Amin Shokrollahi:
Efficient Randomized Generation of Optimal Algorithms for Multiplication in Certain Finite Fields. 67-96 - Stephen J. Bellantoni, Stephen A. Cook:
A New Recursion-Theoretic Characterization of the Polytime Functions. 97-110 - Matthijs J. Coster, Antoine Joux, Brian A. LaMacchia, Andrew M. Odlyzko, Claus-Peter Schnorr, Jacques Stern:
Improved Low-Density Subset Sum Algorithms. 111-128 - Igor E. Shparlinski:
A Deterministic Test for Permutation Polynomials. 129-132 - D. Yu. Grigoryev, Nicolai N. Vorobjov Jr.:
Counting Connected Components of a Semialgebraic Set in Subexponential Time. 133-186 - Joachim von zur Gathen, Victor Shoup:
Computing Frobenius Maps and Factoring Polynomials. 187-224 - Lajos Rónyai:
Algorithmic Properties of Maximal Orders in Simple Algebras over Q. 225-243 - Nader H. Bshouty, Yishay Mansour, Baruch Schieber, Prasoon Tiwari:
Fast Exponentiation Using the Truncation Operation. 244-255 - Katia S. Guimarães, William I. Gasarch, James M. Purtilo:
Selection Problems via M-Ary Queries. 256-276 - Mikael Goldmann, Johan Håstad, Alexander A. Razborov:
Majority Gates VS. General Weighted Threshold Gates. 277-300 - Johannes Köbler, Uwe Schöning, Jacobo Torán:
Graph Isomorphism is Low for PP. 301-330 - Franz Aurenhammer, Johann Hagauer, Wilfried Imrich:
Cartesian Graph Factorization at Logarithmic Cost per Edge. 331-349 - Omer Berkman, Yossi Matias, Uzi Vishkin:
Randomized Range-Maxima in Nearly-Constant Parallel Time. 350-373 - László Babai, Lance Fortnow, Carsten Lund:
Addendum to Non-Deterministic Exponential Time has Two-Prover Interactive Protocols. 374
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.
last updated on 2025-01-10 18:21 CET 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:
