Paper
Actions
You must be logged in to use all features
Import a .START file
Add this to a Review
Tell someone about this
Search on Google Scholar
Download Bibtex
Download APA reference
Edit this data
Manage associations
Merge it with duplicates
Exec internal actor
Update from DOI
Add multiple references
A birthday repetition theorem and complexity of approximating dense CSPs
Pasin Manurangsi and Prasad Raghavendra. 2017. A birthday repetition theorem and complexity of approximating dense CSPs. In ICALP.
2017
Simplified Graph of Associations
SHOW IT!!! (may be slow...)
How to use it
Use default pruning algorithm
Use alternative pruning algorithm
Generate image with complete graph
Show Graph Info
Download graph data for viewer
Get URL to embbed it anywhere
Word Cloud
Get URL to embbed it anywhere
Search topics on Google Scholar
Research Paradigm
Add/Edit Research Paradigms
Authors
View detailed list
Add an Author
Get URL to embbed this list anywhere
1
Pasin Manurangsi A
Referenced By
View detailed list
Add a Citer
Get URL to embbed this list anywhere
1
(Gap/S)ETH hardness of SVP
Toggle navigation
Login / Register
Help
×
Your opinion
Is it representative of "A birthday repetition theorem and complexity of approximating dense CSPs"?
It does not represent at all.
Poorly representative, misses some key aspects.
Representative, but misses secondary aspects.
Representative, capaturing important aspects.
Very representative.
Does it provide additional information for your research?
Totally disagree.
Partially disagree.
Neutral.
Partially agree.
Totally agree.
How does this feature contributes to your overall usage of this system?
I use the system despite of this feature
Sometimes it is annoying
Neutral
Sometimes it is useful
I use the system because of this feature
Please provide any other comment or suggestion:
Your email (optional):
close
Submit
×
Let other people know about this data
Paper :
A birthday repetition theorem and complexity of approximating dense CSPs
Send a link to this page to:
Send to yourself
Aditional email(s):
Custom message:
close
Send a message
×
Add to a Bibliographic Set
A birthday repetition theorem and complexity of approximating dense CSPs
Reviews owned by user
close
×
Why help?
If you for we can improve the data describing it. In turn, this can help you and other users to improve bibliographical sets and reviews, based on new data we retrieve after your contribution.
close
×
Graph Info
close
×
Information
close
×
Run Internal Actor
close
×
Scientific Paradigms
Select one or more research facets assignable to this publication:
Positivism
Post-Positivism
Critical-Ideological
Constructivism-Interpretativism
Other:
Save
close
×
Add association
First, try and find an existing:
Name
Search
Create a new
close