Остановите войну!
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
- 2007
- Scott Aaronson, Greg Kuperberg:
Quantum versus Classical Proofs and Advice. CCC 2007: 115-128 - Andris Ambainis, Joseph Emerson:
Quantum t-designs: t-wise Independence in the Quantum World. CCC 2007: 129-140 - Luis Antunes, Lance Fortnow, Alexandre Pinto, Andre Souto:
Low-Depth Witnesses are Easy to Find. CCC 2007: 46-51 - Chris Bourke, Raghunath Tewari, N. V. Vinodchandran:
Directed Planar Reachability is in Unambiguous Log-Space. CCC 2007: 217-221 - Mark Braverman, Raghav Kulkarni, Sambuddha Roy:
Parity Problems in Planar Graphs. CCC 2007: 222-235 - Harry Buhrman, Nikolai K. Vereshchagin, Ronald de Wolf:
On Computation and Communication with Small Bias. CCC 2007: 24-32 - Jin-yi Cai, Vinay Choudhary, Pinyan Lu:
On the Theory of Matchgate Computations. CCC 2007: 305-318 - Jin-yi Cai, Pinyan Lu:
Bases Collapse in Holographic Algorithms. CCC 2007: 292-304 - Amit Chakrabarti:
Lower Bounds for Multi-Player Pointer Jumping. CCC 2007: 33-45 - Richard Chang, Suresh Purini:
Bounded Queries and the NP Machine Hypothesis. CCC 2007: 52-59 - Yijia Chen, Jörg Flum:
On Parameterized Path and Chordless Path Problems. CCC 2007: 250-263 - Kai-Min Chung, Omer Reingold, Salil P. Vadhan:
S-T Connectivity on Digraphs with a Known Stationary Distribution. CCC 2007: 236-249 - Richard Cleve, William Slofstra, Falk Unger, Sarvagya Upadhyay:
Perfect Parallel Repetition Theorem for Quantum XOR Proof Systems. CCC 2007: 109-114 - Uriel Feige, Guy Kindler, Ryan O'Donnell:
Understanding Parallel Repetition Requires Understanding Foams. CCC 2007: 179-192 - Venkatesan Guruswami, Christopher Umans, Salil P. Vadhan:
Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes. CCC 2007: 96-108 - Iftach Haitner, Omer Reingold:
A New Interactive Hashing Theorem. CCC 2007: 319-332 - Shirley Halevy, Oded Lachish, Ilan Newman, Dekel Tsur:
Testing Properties of Constraint-Graphs. CCC 2007: 264-277 - Prahladh Harsha, Rahul Jain, David A. McAllester, Jaikumar Radhakrishnan:
The Communication Complexity of Correlation. CCC 2007: 10-23 - Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky:
Efficient Arguments without Short PCPs. CCC 2007: 278-291 - Guillaume Malod:
The Complexity of Polynomials and Their Coefficient Functions. CCC 2007: 193-204 - Wolfgang Merkle, Frank Stephan:
On C-Degrees, H-Degrees and T-Degrees. CCC 2007: 60-69 - Chris Peikert:
Limits on the Hardness of Lattice Problems in ell _p Norms. CCC 2007: 333-346 - Konstantin Pervyshev:
On Heuristic Time Hierarchies. CCC 2007: 347-358 - Grant Schoenebeck, Luca Trevisan, Madhur Tulsiani:
A Linear Round Lower Bound for Lovasz-Schrijver SDP Relaxations of Vertex Cover. CCC 2007: 205-216 - Alexander A. Sherstov:
Halfspace Matrices. CCC 2007: 83-95 - Kei Uchizawa, Eiji Takimoto:
An Exponential Lower Bound on the Size of Constant-Depth Threshold Circuits with Small Energy Complexity. CCC 2007: 169-178 - Emanuele Viola:
On Approximate Majority and Probabilistic Time. CCC 2007: 155-168 - Emanuele Viola, Avi Wigderson:
Norms, XOR Lemmas, and Lower Bounds for GF(2) Polynomials and Multiparty Protocols. CCC 2007: 141-154 - Ryan Williams:
Time-Space Tradeoffs for Counting NP Solutions Modulo Integers. CCC 2007: 70-82 - Marius Zimand:
On Derandomizing Probabilistic Sublinear-Time Algorithms. CCC 2007: 1-9
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-06-24 01:10 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