default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAdam Kurpisz
- > Home > Persons > Adam Kurpisz
Publications
- 2024
[j12]Adam Kurpisz
, Samuli Leppänen, Monaldo Mastrolilli:
Tight Sum-of-squares Lower Bounds for Binary Polynomial2 Optimization Problems. ACM Trans. Comput. Theory 16(1): 3:1-3:16 (2024)- 2020
- [j9]Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli:
Sum-of-squares hierarchy lower bounds for symmetric formulations. Math. Program. 182(1): 369-397 (2020) - 2018
- [j8]Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli:
Sum-of-squares rank upper bounds for matching problems. J. Comb. Optim. 36(3): 831-844 (2018) - 2017
- [j6]Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli:
On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy. Math. Oper. Res. 42(1): 135-143 (2017) - [j5]Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli:
An unbounded Sum-of-Squares hierarchy integrality gap for a polynomially solvable problem. Math. Program. 166(1-2): 1-17 (2017) - 2016
- [c11]Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli:
Tight Sum-Of-Squares Lower Bounds for Binary Polynomial Optimization Problems. ICALP 2016: 78:1-78:14 - [c9]Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli:
Sum-of-Squares Hierarchy Lower Bounds for Symmetric Formulations. IPCO 2016: 362-374 - [c8]Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli:
Sum-of-Squares Rank Upper Bounds for Matching Problems. ISCO 2016: 403-413 - [i6]Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli:
Tight Sum-of-Squares lower bounds for binary polynomial optimization problems. CoRR abs/1605.03019 (2016) - [i5]Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli:
Sum-of-squares hierarchy lower bounds for symmetric formulations. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [c7]Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli:
A Lasserre Lower Bound for the Min-Sum Single Machine Scheduling Problem. ESA 2015: 853-864 - [c6]Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli:
On the Hardest Problem Formulations for the 0/1 0 / 1 Lasserre Hierarchy. ICALP (1) 2015: 872-885 - [i4]Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli:
On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy. CoRR abs/1510.01891 (2015) - [i3]Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli:
A Lasserre Lower Bound for the Min-Sum Single Machine Scheduling Problem. CoRR abs/1511.08644 (2015) - 2014
- [c4]Nicolas Boria, Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli:
Improved Approximation for the Maximum Duo-Preservation String Mapping Problem. WABI 2014: 14-25 - [i1]Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli:
On the Lasserre/Sum-of-Squares Hierarchy with Knapsack Covering Inequalities. CoRR abs/1407.1746 (2014)
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.
last updated on 2024-08-05 21:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
