Skip to contents

Greiner, Johannes [Author] ; Bodirsky, Manuel [Degree supervisor]; Jonsson, Peter [Degree supervisor] Technische Universität Dresden

Complexity of constraint satisfaction problems for unions of theories

View online
Schließen

Access

... to E-book via Resolving system

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Dresden, [2021?]
Schöning, Uwe [Author]

On the complexity of constraint satisfaction problems

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Ulm: Univ., Fak. für Informatik, 1999

Published in: Ulmer Informatik-Berichte ; 99,03
Viola, Caterina [Author] ; Technische Universität Dresden

Valued constraint satisfaction problems over infinite domains

View online
Schließen

Access

... to E-book via Resolving system

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Dresden, 17. Juni 2020
Khanna, Sanjeev [Author]; Sudan, Madhu [Author]; Williamson, David P. [Author]

A complete classification of the approximability of maximization problems derived from boolean constraint satisfaction

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Almaden [u.a.]: IBM, 1997

Published in: Thomas J. Watson Research Center: Research report / RC ; 20745
Musipatla, Amulya [Author]; O'Donnell, Ryan [Author]; Schramm, Tselil [Author]; Wu, Xinyu [Author] ; Amulya Musipatla and Ryan O'Donnell and Tselil Schramm and Xinyu Wu [Contributor]

The SDP Value of Random 2CSPs

View online
Schließen

Links

... to article via DOI

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022
Creignou, Nadia [Author]; Kolaitis, Phokion [Author]; Vollmer, Heribert [Author] ; Nadia Creignou and Phokion Kolaitis and Heribert Vollmer [Contributor]

06401 Executive Summary – Complexity of Constraints

View online
Schließen

Links

... to article via DOI

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2006
Mottet, Antoine [Author]; Nagy, Tomáš [Author]; Pinsker, Michael [Author] ; Antoine Mottet and Tomáš Nagy and Michael Pinsker [Contributor]

An Order out of Nowhere: A New Algorithm for Infinite-Domain {CSP}s

View online
Schließen

Links

... to article via DOI

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
Kol, Gillat [Author]; Paramonov, Dmitry [Author]; Saxena, Raghuvansh R. [Author]; Yu, Huacheng [Author] ; Gillat Kol and Dmitry Paramonov and Raghuvansh R. Saxena and Huacheng Yu [Contributor]

Characterizing the Multi-Pass Streaming Complexity for Solving Boolean CSPs Exactly

View online
Schließen

Links

... to article via DOI

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2023
Mohanty, Sidhanth [Author]; O'Donnell, Ryan [Author]; Paredes, Pedro [Author] ; Sidhanth Mohanty and Ryan O'Donnell and Pedro Paredes [Contributor]

The SDP Value for Random Two-Eigenvalue CSPs

View online
Schließen

Links

... to article via DOI

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2020
Larose, Benoit [Author] ; Benoit Larose [Contributor]

Algebra and the Complexity of Digraph CSPs: a Survey

View online
Schließen

Links

... to article via DOI

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2017
Krokhin, Andrei [Author]; Zivny, Stanislav [Author] ; Andrei Krokhin and Stanislav Zivny [Contributor]

The Complexity of Valued CSPs

View online
Schließen

Links

... to article via DOI

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2017
Bodirsky, Manuel [Author]; Mamino, Marcello [Author] ; Manuel Bodirsky and Marcello Mamino [Contributor]

Constraint Satisfaction Problems over Numeric Domains

View online
Schließen

Links

... to article via DOI

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2017
Cooper, Martin C. [Author]; Zivny, Stanislav [Author] ; Martin C. Cooper and Stanislav Zivny [Contributor]

Hybrid Tractable Classes of Constraint Problems

View online
Schließen

Links

... to article via DOI

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2017
Guruswami, Venkatesan [Author]; Lee, Euiwoong [Author] ; Venkatesan Guruswami and Euiwoong Lee [Contributor]

Inapproximability of H-Transversal/Packing

View online
Schließen

Links

... to article via DOI

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2015
Guruswami, Venkatesan [Author]; Lee, Euiwoong [Author] ; Venkatesan Guruswami and Euiwoong Lee [Contributor]

Towards a Characterization of Approximation Resistance for Symmetric CSPs

View online
Schließen

Links

... to article via DOI

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2015
Barto, Libor [Author]; Battistelli, Diego [Author]; Berg, Kevin M. [Author] ; Libor Barto and Diego Battistelli and Kevin M. Berg [Contributor]

Symmetric Promise Constraint Satisfaction Problems: Beyond the Boolean Case

View online
Schließen

Links

... to article via DOI

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021
Matl, Gregor [Author]; Živný, Stanislav [Author] ; Gregor Matl and Stanislav Živný [Contributor]

Beyond Boolean Surjective VCSPs

View online
Schließen

Links

... to article via DOI

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2019
Guruswami, Venkatesan [Author]; Ren, Xuandi [Author]; Sandeep, Sai [Author] ; Venkatesan Guruswami and Xuandi Ren and Sai Sandeep [Contributor]

Baby PIH: Parameterized Inapproximability of Min CSP

View online
Schließen

Links

... to article via DOI

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
Ghoshal, Suprovat [Author] ; Suprovat Ghoshal [Contributor]

The Biased Homogeneous r-Lin Problem

View online
Schließen

Links

... to article via DOI

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022
Hsieh, Jun-Ting [Author]; Mohanty, Sidhanth [Author]; Xu, Jeff [Author] ; Jun-Ting Hsieh and Sidhanth Mohanty and Jeff Xu [Contributor]

Certifying Solution Geometry in Random CSPs: Counts, Clusters and Balance

View online
Schließen

Links

... to article via DOI

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022

You did not find what you were looking for?

Purchase suggestion
Are you missing something you need for your research? If you have any suggestions please share them here.

Interlibrary Loan
Please search and order your favorite title in the Interlibrary Loan Portal.

Search in field:

Recently searched for:

You did not find what you were looking for?

> Year of publication

Year of publication