On quadratic threshold CSPs

On quadratic threshold CSPs

Discrete Algorithms

Bibliographic Details
Main Authors:	Per Austrin, Siavosh Benabbas, Avner Magen
Format:	Article
Language:	English
Published:	Discrete Mathematics & Theoretical Computer Science 2012-11-01
Series:	Discrete Mathematics & Theoretical Computer Science
Subjects:	[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
Online Access:	https://dmtcs.episciences.org/591/pdf

Similar Items

On quadratic residue codes and hyperelliptic curves
by: David Joyner
Published: (2008-01-01)

Random graphs with bounded maximum degree: asymptotic structure and a logical limit law
by: Vera Koponen
Published: (2012-11-01)

Digraph complexity measures and applications in formal language theory
by: Hermann Gruber
Published: (2012-11-01)

A note on planar Ramsey numbers for a triangle versus wheels
by: Guofei Zhou, et al.
Published: (2012-11-01)

Clustered Spanning Tree - Conditions for Feasibility
by: Nili Guttmann-Beck, et al.
Published: (2019-08-01)

Detection number of bipartite graphs and cubic graphs
by: Frederic Havet, et al.
Published: (2014-12-01)

Strong parity vertex coloring of plane graphs
by: Tomas Kaiser, et al.
Published: (2014-03-01)

The Cerný conjecture for automata respecting intervals of a directed graph
by: Mariusz Grech, et al.
Published: (2013-11-01)

A variant of Niessen’s problem on degreesequences of graphs
by: Jiyun Guo, et al.
Published: (2014-05-01)

Clique cycle transversals in graphs with few P₄'s
by: Raquel Bravo, et al.
Published: (2013-09-01)

A new characterization and a recognition algorithm of Lucas cubes
by: Andrej Taranenko
Published: (2013-10-01)

The resolving number of a graph Delia
by: Delia Garijo, et al.
Published: (2013-12-01)

Strong parity vertex coloring of plane graphs
by: Tomas Kaiser, et al.
Published: (2014-01-01)

On the complexity of distributed BFS in ad hoc networks with non-spontaneous wake-ups
by: Dariusz Kowalski, et al.
Published: (2013-11-01)

1-local 33/24-competitive Algorithm for Multicoloring Hexagonal Graphs
by: Rafal Witkowski, et al.
Published: (2013-11-01)

Two player game variant of the Erd\H os-Szekeres problem
by: Parikshit Kolipaka, et al.
Published: (2013-11-01)

The Magnus-Derek game in groups
by: Dániel Gerbner
Published: (2013-11-01)

Surjective cellular automata far from the Garden of Eden
by: Silvio Capobianco, et al.
Published: (2013-10-01)

Computing the number of h-edge spanning forests in complete bipartite graphs
by: Rebecca Stones
Published: (2014-05-01)

On the connectedness and diameter of a geometric Johnson graph
by: Crevel Bautista-Santiago, et al.
Published: (2013-09-01)

Robot's hand and expansions in non-integer bases
by: Paola Loreti, et al.
Published: (2014-06-01)

The b-chromatic number of powers of cycles
by: Anja Kohl
Published: (2013-03-01)

Note on the weighted internal path length of b-ary trees
by: Ludger Rüschendorf, et al.
Published: (2007-01-01)

On Compact Encoding of Pagenumber $k$ Graphs
by: Cyril Gavoille, et al.
Published: (2008-01-01)

Foreword to the special issue dedicated to the tenth ''Journées montoises d'informatique théorique''
by: Véronique Bruyère, et al.
Published: (2007-01-01)

The determining number of Kneser graphs
by: José Cáceres, et al.
Published: (2013-01-01)

List edge and list total colorings of planar graphs without non-induced 7-cycles
by: Aijun Dong, et al.
Published: (2013-03-01)

Coding partitions
by: Fabio Burderi, et al.
Published: (2007-01-01)

A lower bound for approximating the Grundy number
by: Guy Kortsarz
Published: (2007-01-01)

Nordhaus-Gaddum Type Results for Total Domination
by: Michael Henning, et al.
Published: (2011-12-01)

On the Book Thickness of k-Trees
by: Vida Dujmović, et al.
Published: (2011-10-01)

Baire and automata
by: Pierre Simonnet, et al.
Published: (2007-01-01)

Immersion containment and connectivity in color-critical graphs
by: Faisal N. Abu-Khzam, et al.
Published: (2012-10-01)

On the residual solvability of generalized free products of solvable groups
by: Delaram Kahrobaei, et al.
Published: (2011-11-01)

On the number of factors in codings of three interval exchange
by: Petr Ambrož, et al.
Published: (2011-11-01)

FP/FIFO scheduling: coexistence of deterministic and probabilistic QoS guarantees
by: Pascale Minet, et al.
Published: (2007-01-01)

Asymptotic results for silent elimination
by: Guy Louchard, et al.
Published: (2010-01-01)

Acyclic chromatic index of fully subdivided graphs and Halin graphs
by: Manu Basavaraju
Published: (2012-10-01)

On the sensitivity of cyclically-invariant Boolean functions
by: Sourav Chakraborty
Published: (2011-12-01)

Extremal K_(s,t)-free bipartite graphs
by: Camino Balbuena, et al.
Published: (2008-01-01)