Остановите войну!
for scientists:
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 31 matches
- 1996
- Manindra Agrawal, Eric Allender:
An Isomorphism Theorem for Circuit Complexity. CCC 1996: 2-11 - Manindra Agrawal, Vikraman Arvind:
A Note on Decision versus Search for Graph Automorphism. CCC 1996: 272-277 - Klaus Ambos-Spies, Elvira Mayordomo, Xizhong Zheng:
A Comparison of Weak Completeness Notions. CCC 1996: 171-178 - Eric Bach, Anne Condon, Elton Glaser, Celena Tanguay:
DNA Models and Algorithms for NP-complete Problems. CCC 1996: 290-300 - Ian Barland, Phokion G. Kolaitis, Madhukar N. Thakur:
Integer Programming as a Framework for Optimization and Approximability. CCC 1996: 249-259 - Samuel R. Buss, Toniann Pitassi:
Good Degree Bounds on Nullstellensatz Refutations of the Induction Principle. CCC 1996: 233-242 - Hervé Caussinus, Pierre McKenzie, Denis Thérien, Heribert Vollmer:
Nondeterministic NC1 Computation. CCC 1996: 12-21 - Uriel Feige, Joe Kilian:
Zero Knowledge and the Chromatic Number. CCC 1996: 278-287 - Uriel Feige, Oleg Verbitsky:
Error Reduction by Parallel Repetition - a Negative Result. CCC 1996: 70-76 - Joan Feigenbaum, Lance Fortnow, Sophie Laplante, Ashish V. Naik:
On Coherence, Random-self-reducibility, and Self-correction. CCC 1996: 59-67 - Stephen A. Fenner, Lance Fortnow, Ashish V. Naik, John D. Rogers:
Inverting Onto Functions. CCC 1996: 213-222 - Stephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer:
Complements of Multivalued Functions. CCC 1996: 260-269 - Lance Fortnow, Judy Goldsmith, Stephen R. Mahaney:
L-Printable Sets. CCC 1996: 97-106 - Georg Gottlob:
Collapsing Oracle-Tape Hierarchies. CCC 1996: 33-42 - Kazuo Iwama, Chuzo Iwamoto:
Parallel Complexity Hierarchies Based on PRAMs and DLOGTIME-Uniform Circuits. CCC 1996: 24-32 - Ker-I Ko, Klaus Weihrauch:
On the Measure of Two-Dimensional Regions with Polynomial-Time computables Boundaries. CCC 1996: 150-159 - Pascal Koiran:
VC Dimension in Circuit Complexity. CCC 1996: 81-85 - Clemens Lautemann, Thomas Schwentick, Iain A. Stewart:
On Positive P. CCC 1996: 162-170 - Ming Li, Paul M. B. Vitányi:
Reversible Simulation of Irreversible Computation. CCC 1996: 301-306 - Dieter van Melkebeek:
Reducing P to a Sparse Set using a Constant Number of Queries Collapses P to L. CCC 1996: 88-96 - Ashish V. Naik, Alan L. Selman:
A Note on P-selective sets and on Adaptive versus Nonadaptive Queries to NP. CCC 1996: 224-232 - Noam Nisan:
Extracting Randomness: How and Why A survey. CCC 1996: 44-58 - Christos H. Papadimitriou:
The Complexity of Knowledge Representation. CCC 1996: 244-248 - Michael E. Saks:
Randomization and Derandomization in Space_Bounded Computation. CCC 1996: 128-149 - Marcus Schäfer:
Deciding the Vapnik-Cervonenkis dimension is SigmaP3-complete. CCC 1996: 77-80 - Rainer Schuler:
Truth-table Closure and Turing Closure of Average Polynomial Time have Different Measures in EXP. CCC 1996: 190-195 - Alan L. Selman:
Much Ado about Functions. CCC 1996: 198-212 - Helmut Veith:
Succinct Representation, Leaf Languages, and Projection Reductions. CCC 1996: 118-126 - V. Vinay:
Hierarchies of Circuit Classes that are Closed under Complement. CCC 1996: 108-117 - Yongge Wang:
The Law of the Iterated Logarithm for p-Random Sequences. CCC 1996: 180-189
skipping 1 more match
loading more results
failed to load more results, please try again later
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-05-29 03:01 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