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 87 matches
- 2003
- Vince Grolmusz:
Near Quadratic Matrix Multiplication Modulo Composites. Electron. Colloquium Comput. Complex. TR03 (2003) - Stefan Szeider:
Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable. Electron. Colloquium Comput. Complex. TR03 (2003) - Fahiem Bacchus, Shannon Dalmao, Toniann Pitassi:
DPLL with Caching: A new algorithm for #SAT and Bayesian Inference. Electron. Colloquium Comput. Complex. TR03 (2003) - Eli Ben-Sasson, Prahladh Harsha:
Lower Bounds for Bounded-Depth Frege Proofs via Buss-Pudlack Games. Electron. Colloquium Comput. Complex. TR03 (2003) - Scott Aaronson:
Quantum Certificate Complexity. Electron. Colloquium Comput. Complex. TR03 (2003) - Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodnikova:
3CNF Properties are Hard to Test. Electron. Colloquium Comput. Complex. TR03 (2003) - Olivier Dubois, Yacine Boufkhad, Jacques Mandler:
Typical random 3-SAT formulae and the satisfiability threshold. Electron. Colloquium Comput. Complex. TR03 (2003) - Piotr Berman, Marek Karpinski:
Improved Approximation Lower Bounds on Small Occurrence Optimization. Electron. Colloquium Comput. Complex. TR03 (2003) - Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey:
Private Computation - k-connected versus 1-connected Networks. Electron. Colloquium Comput. Complex. TR03 (2003) - Sven Baumer, Rainer Schuler:
Improving a probabilistic 3-SAT Algorithm by Dynamic Search and Independent Clause Pairs. Electron. Colloquium Comput. Complex. TR03 (2003) - Christian Glaßer, Alan L. Selman, Samik Sengupta, Liyu Zhang:
Disjoint NP-Pairs. Electron. Colloquium Comput. Complex. TR03 (2003) - Edward A. Hirsch, Arist Kojevnikov:
Several notes on the power of Gomory-Chvatal cuts. Electron. Colloquium Comput. Complex. TR03 (2003) - Luca Trevisan:
An epsilon-Biased Generator in NC0. Electron. Colloquium Comput. Complex. TR03 (2003) - Avrim Blum, Ke Yang:
On Statistical Query Sampling and NMR Quantum Computing. Electron. Colloquium Comput. Complex. TR03 (2003) - Shafi Goldwasser, Yael Tauman:
On the (In)security of the Fiat-Shamir Paradigm. Electron. Colloquium Comput. Complex. TR03 (2003) - Dimitrios Koukopoulos, Marios Mavronicolas, Paul G. Spirakis:
FIFO is Unstable at Arbitrarily Low Rates. Electron. Colloquium Comput. Complex. TR03 (2003) - Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener:
On Converting CNF to DNF. Electron. Colloquium Comput. Complex. TR03 (2003) - Matthias Galota, Heribert Vollmer:
Functions Computable in Polynomial Space. Electron. Colloquium Comput. Complex. TR03 (2003) - Eli Ben-Sasson, Oded Goldreich, Madhu Sudan:
Bounds on 2-Query Codeword Testing. Electron. Colloquium Comput. Complex. TR03 (2003) - Elad Hazan, Shmuel Safra, Oded Schwartz:
On the Hardness of Approximating k-Dimensional Matching. Electron. Colloquium Comput. Complex. TR03 (2003) - Mikhail N. Vyalyi:
QMA=PP implies that PP contains PH. Electron. Colloquium Comput. Complex. TR03 (2003) - Piotr Berman, Marek Karpinski, Alex D. Scott:
Approximation Hardness and Satisfiability of Bounded Occurrence Instances of SAT. Electron. Colloquium Comput. Complex. TR03 (2003) - Anna Palbom:
On Spanning Cacti and Asymmetric TSP. Electron. Colloquium Comput. Complex. TR03 (2003) - Till Tantau:
Weak Cardinality Theorems for First-Order Logic. Electron. Colloquium Comput. Complex. TR03 (2003) - Kristoffer Arnsfelt Hansen:
Constant width planar computation characterizes ACC0. Electron. Colloquium Comput. Complex. TR03 (2003) - Janka Chlebíková, Miroslav Chlebík:
Inapproximability results for bounded variants of optimization problems. Electron. Colloquium Comput. Complex. TR03 (2003) - Christian Glaßer, Alan L. Selman, Samik Sengupta:
Reductions between Disjoint NP-Pairs. Electron. Colloquium Comput. Complex. TR03 (2003) - Olivier Powell:
PSPACE contains almost complete problems. Electron. Colloquium Comput. Complex. TR03 (2003) - Philippe Moser:
BPP has effective dimension at most 1/2 unless BPP=EXP. Electron. Colloquium Comput. Complex. TR03 (2003) - Amin Coja-Oghlan, Andreas Goerdt, André Lanka, Frank Schädlich:
Certifying Unsatisfiability of Random 2k-SAT Formulas using Approximation Techniques. Electron. Colloquium Comput. Complex. TR03 (2003)
skipping 57 more matches
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-09-25 23:43 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