|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 8 occurrences of 7 keywords
|
|
|
Results
Found 10 publication records. Showing 10 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
145 | Jens Gramm, Rolf Niedermeier |
Faster Exact Solutions for MAX2SAT. |
CIAC |
2000 |
DBLP DOI BibTeX RDF |
MAX2SAT, Maximum Cut, NP-complete problems, exact algorithms, parameterized complexity |
133 | Masaki Yamamoto 0001 |
A Spectral Method for MAX2SAT in the Planted Solution Model. |
ISAAC |
2007 |
DBLP DOI BibTeX RDF |
|
96 | Allan Borodin |
Further Reflections on a Theory for Basic Algorithms. |
AAIM |
2006 |
DBLP DOI BibTeX RDF |
|
85 | Masaki Yamamoto 0001 |
Generating Instances for MAX2SAT with Optimal Solutions. |
Theory Comput. Syst. |
2006 |
DBLP DOI BibTeX RDF |
|
48 | Per Austrin |
Balanced max 2-sat might not be the hardest. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
Max 2-Sat, inapproximability, unique games conjecture |
36 | Carlos Ansótegui, Jordi Levy |
Reducing SAT to Max2SAT. |
IJCAI |
2021 |
DBLP DOI BibTeX RDF |
|
36 | Po-Wei Wang, J. Zico Kolter |
Low-Rank Semidefinite Programming for the MAX2SAT Problem. |
AAAI |
2019 |
DBLP DOI BibTeX RDF |
|
36 | Po-Wei Wang, J. Zico Kolter |
Low-rank semidefinite programming for the MAX2SAT problem. |
CoRR |
2018 |
DBLP BibTeX RDF |
|
24 | Prasad Raghavendra |
Optimal algorithms and inapproximability results for every CSP? |
STOC |
2008 |
DBLP DOI BibTeX RDF |
dictatorship tests, rounding schemes, semidefinite programming, constraint satisfaction problem, unique games conjecture |
24 | Xenofontas A. Dimitropoulos, Dmitri V. Krioukov, Bradley Huffaker, Kimberly C. Claffy, George F. Riley |
Inferring AS Relationships: Dead End or Lively Beginning? |
WEA |
2005 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #10 of 10 (100 per page; Change: )
|
|