Остановите войну!
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 48 matches
- 1999
- Detlef Sieling:
The Complexity of Minimizing FBDDs. Electron. Colloquium Comput. Complex. TR99 (1999) - Oded Goldreich, Daniele Micciancio, Shmuel Safra, Jean-Pierre Seifert:
Approximating Shortest Lattice Vectors is Not Harder Than Approximating Closest Lattice Vectors. Electron. Colloquium Comput. Complex. TR99 (1999) - Stephen A. Fenner, Frederic Green, Steven Homer, Randall Pruim:
Determining Acceptance Possibility for a Quantum Computation is Hard for the Polynomial Hierarchy. Electron. Colloquium Comput. Complex. TR99 (1999) - Valentine Kabanets:
Almost k-Wise Independence and Boolean Functions Hard for Read-Once Branching Programs. Electron. Colloquium Comput. Complex. TR99 (1999) - Michael Schmitt:
On the Sample Complexity for Nonoverlapping Neural Networks. Electron. Colloquium Comput. Complex. TR99 (1999) - Jin-yi Cai:
Some Recent Progress on the Complexity of Lattice Problems. Electron. Colloquium Comput. Complex. TR99 (1999) - Juraj Hromkovic, Georg Schnitger:
On the Power of Las Vegas II: Two-Way Finite Automata. Electron. Colloquium Comput. Complex. TR99 (1999) - Eric Allender, Vikraman Arvind, Meena Mahajan:
Arithmetic Complexity, Kleene Closure, and Formal Power Series. Electron. Colloquium Comput. Complex. TR99 (1999) - Marek Karpinski, Rustam Mubarakzjanov:
A Note on Las Vegas OBDDs. Electron. Colloquium Comput. Complex. TR99 (1999) - Eric Allender, Igor E. Shparlinski, Michael E. Saks:
A Lower Bound for Primality. Electron. Colloquium Comput. Complex. TR99 (1999) - Matthias Krause, Petr Savický, Ingo Wegener:
Approximations by OBDDs and the variable ordering problem. Electron. Colloquium Comput. Complex. TR99 (1999) - Eric Allender, Andris Ambainis, David A. Mix Barrington, Samir Datta, Huong LeThanh:
Bounded Depth Arithmetic Circuits: Counting and Closure. Electron. Colloquium Comput. Complex. TR99 (1999) - Oded Goldreich, Amit Sahai, Salil P. Vadhan:
Can Statistical Zero Knowledge be made Non-Interactive? or On the Relationship of SZK and NISZK. Electron. Colloquium Comput. Complex. TR99 (1999) - Alexander A. Razborov, Nikolai K. Vereshchagin:
One Property of Cross-Intersecting Families. Electron. Colloquium Comput. Complex. TR99 (1999) - Irit Dinur, Shmuel Safra:
On the Hardness of Approximating Label Cover. Electron. Colloquium Comput. Complex. TR99 (1999) - Irit Dinur:
Approximating SVPinfty to within Almost-Polynomial Factors is NP-hard. Electron. Colloquium Comput. Complex. TR99 (1999) - Yevgeniy Dodis, Oded Goldreich, Eric Lehman, Sofya Raskhodnikova, Dana Ron, Alex Samorodnitsky:
Improved Testing Algorithms for Monotonicity. Electron. Colloquium Comput. Complex. TR99 (1999) - Manindra Agrawal, Somenath Biswas:
Reducing Randomness via Chinese Remaindering. Electron. Colloquium Comput. Complex. TR99 (1999) - Detlef Sieling:
Lower Bounds for Linear Transformed OBDDs and FBDDs. Electron. Colloquium Comput. Complex. TR99 (1999) - Marek Karpinski:
Randomized Complexity of Linear Arrangements and Polyhedra. Electron. Colloquium Comput. Complex. TR99 (1999) - Igor E. Shparlinski:
On the Uniformity of Distribution of a Certain Pseudo-Random Function. Electron. Colloquium Comput. Complex. TR99 (1999) - Eli Ben-Sasson, Avi Wigderson:
Short Proofs are Narrow - Resolution made Simple. Electron. Colloquium Comput. Complex. TR99 (1999) - Amir Shpilka, Avi Wigderson:
Depth-3 Arithmetic Formulae over Fields of Characteristic Zero. Electron. Colloquium Comput. Complex. TR99 (1999) - Oded Goldreich, Shafi Goldwasser, Silvio Micali:
Interleaved Zero-Knowledge in the Public-Key Model. Electron. Colloquium Comput. Complex. TR99 (1999) - Yonatan Aumann, Johan Håstad, Michael O. Rabin, Madhu Sudan:
Linear Consistency Testing. Electron. Colloquium Comput. Complex. TR99 (1999) - Miklós Ajtai:
A Non-linear Time Lower Bound for Boolean Branching Programs. Electron. Colloquium Comput. Complex. TR99 (1999) - Marek Karpinski, Igor E. Shparlinski:
On the Computational Hardness of Testing Square-Freeness of Sparse Polynomials. Electron. Colloquium Comput. Complex. TR99 (1999) - Stefan Edelkamp, Ingo Wegener:
On the performance of WEAK-HEAPSORT. Electron. Colloquium Comput. Complex. TR99 (1999) - Ilya Dumer, Daniele Micciancio, Madhu Sudan:
Hardness of Approximating the Minimum Distance of a Linear Code. Electron. Colloquium Comput. Complex. TR99 (1999) - Meena Mahajan, P. R. Subramanya, V. Vinay:
A Combinatorial Algorithm for Pfaffians. Electron. Colloquium Comput. Complex. TR99 (1999)
skipping 18 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-05-24 22:38 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