![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 17 matches
- 1992
- Franz Aurenhammer, Johann Hagauer, Wilfried Imrich
:
Cartesian Graph Factorization at Logarithmic Cost per Edge. Comput. Complex. 2: 331-349 (1992) - László Babai
, Lance Fortnow, Carsten Lund:
Addendum to Non-Deterministic Exponential Time has Two-Prover Interactive Protocols. Comput. Complex. 2: 374 (1992) - Richard Beigel, Joan Feigenbaum:
On Being Incoherent Without Being Very Hard. Comput. Complex. 2: 1-17 (1992) - Stephen J. Bellantoni, Stephen A. Cook:
A New Recursion-Theoretic Characterization of the Polytime Functions. Comput. Complex. 2: 97-110 (1992) - Omer Berkman, Yossi Matias, Uzi Vishkin:
Randomized Range-Maxima in Nearly-Constant Parallel Time. Comput. Complex. 2: 350-373 (1992) - Nader H. Bshouty, Yishay Mansour, Baruch Schieber, Prasoon Tiwari:
Fast Exponentiation Using the Truncation Operation. Comput. Complex. 2: 244-255 (1992) - Matthijs J. Coster, Antoine Joux, Brian A. LaMacchia, Andrew M. Odlyzko, Claus-Peter Schnorr, Jacques Stern:
Improved Low-Density Subset Sum Algorithms. Comput. Complex. 2: 111-128 (1992) - Joachim von zur Gathen, Victor Shoup:
Computing Frobenius Maps and Factoring Polynomials. Comput. Complex. 2: 187-224 (1992) - Mikael Goldmann, Johan Håstad
, Alexander A. Razborov:
Majority Gates VS. General Weighted Threshold Gates. Comput. Complex. 2: 277-300 (1992) - Judy Goldsmith
, Lane A. Hemachandra
, Kenneth Kunen:
Polynomial-Time Compression. Comput. Complex. 2: 18-39 (1992) - D. Yu. Grigoryev, Nicolai N. Vorobjov Jr.:
Counting Connected Components of a Semialgebraic Set in Subexponential Time. Comput. Complex. 2: 133-186 (1992) - Katia S. Guimarães, William I. Gasarch, James M. Purtilo:
Selection Problems via M-Ary Queries. Comput. Complex. 2: 256-276 (1992) - Johannes Köbler, Uwe Schöning, Jacobo Torán:
Graph Isomorphism is Low for PP. Comput. Complex. 2: 301-330 (1992) - James F. Lynch:
The Quantifier Structure of Sentences That Characterize Nondeterministic Time Complexity. Comput. Complex. 2: 40-66 (1992) - Lajos Rónyai:
Algorithmic Properties of Maximal Orders in Simple Algebras over Q. Comput. Complex. 2: 225-243 (1992) - Mohammad Amin Shokrollahi:
Efficient Randomized Generation of Optimal Algorithms for Multiplication in Certain Finite Fields. Comput. Complex. 2: 67-96 (1992) - Igor E. Shparlinski
:
A Deterministic Test for Permutation Polynomials. Comput. Complex. 2: 129-132 (1992)
loading more results
failed to load more results, please try again later
![](https://dblp.org/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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-09-11 18:19 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