Computational Complexity

LDPC Codes Achieve List Decoding Capacity

📝 Original Info Title: LDPC Codes Achieve List Decoding Capacity ArXiv ID: 1909.06430 Date: 2024-07-11 Authors: Jonathan Mosheiff, Nicolas Resch, Noga Ron-Zewi, Shashwat Silas, and Mary Wootters 📝 Abstract We show that Gallager's ensemble of …

July 11, 2024

Computational Complexity Mathematics Information Theory Computer Science

The Complexity of Contracting Planar Tensor Network

📝 Original Info Title: The Complexity of Contracting Planar Tensor Network ArXiv ID: 2001.10204 Date: 2023-07-06 Authors: Liu Ying 📝 Abstract Tensor networks have been an important concept and technique in many research areas, such as quantum …

July 06, 2023

Computational Complexity Network Computer Science

No Image

Colouring graphs with constraints on connectivity

📝 Original Info Title: Colouring graphs with constraints on connectivity ArXiv ID: 1505.01616 Date: 2022-03-07 Authors: Pierre Aboulker, Nick Brettell, Frederic Havet, Daniel Marx, Nicolas Trotignon 📝 Abstract A graph $G$ has maximal local …

March 07, 2022

Computational Complexity Computer Science Mathematics

No Image

The Complexity of Online Bribery in Sequential Elections

📝 Original Info Title: The Complexity of Online Bribery in Sequential Elections ArXiv ID: 1906.08308 Date: 2021-10-26 Authors: Edith Hemaspaandra, Lane A. Hemaspaandra, Joerg Rothe 📝 Abstract Prior work on the complexity of bribery assumes that the …

October 26, 2021

Computational Complexity Game Theory Multiagent Systems Computer Science

Hitting minors on bounded treewidth graphs. IV. An optimal algorithm

📝 Original Info Title: Hitting minors on bounded treewidth graphs. IV. An optimal algorithm ArXiv ID: 1907.04442 Date: 2021-03-12 Authors: Julien Baste, Ignasi Sau, Dimitrios M. Thilikos 📝 Abstract For a fixed finite collection of graphs ${\cal F}$, …

March 12, 2021

Computational Complexity Data Structures Mathematics Computer Science

Edge Matching with Inequalities, Triangles, Unknown Shape, and Two Players

📝 Original Info Title: Edge Matching with Inequalities, Triangles, Unknown Shape, and Two Players ArXiv ID: 2002.03887 Date: 2020-06-04 Authors: Jeffrey Bosboom, Charlotte Chen, Lily Chung, Spencer Compton, Michael Coulombe, Erik D. Demaine, Martin …

June 04, 2020

Computational Complexity Computational Geometry Computer Science

No Image

The Lagrangian remainder of Taylors series, distinguishes $mathcal{O}(f(x))$ time complexities to polynomials or not

📝 Original Info Title: The Lagrangian remainder of Taylors series, distinguishes $mathcal{O}(f(x))$ time complexities to polynomials or not ArXiv ID: 2001.11811 Date: 2020-05-28 Authors: Nikolaos P. Bakas and Elias Kosmatopoulos, Mihalis Nicolaou and …

May 28, 2020

Computational Complexity Computer Science

No Image

Approximate counting CSP seen from the other side

📝 Original Info Title: Approximate counting CSP seen from the other side ArXiv ID: 1907.07922 Date: 2020-05-15 Authors: Andrei A. Bulatov and Stanislav Zivny 📝 Abstract In this paper we study the complexity of counting Constraint Satisfaction …

May 15, 2020

Computational Complexity Computer Science Discrete Mathematics

No Image

Lower Bounds for Function Inversion with Quantum Advice

📝 Original Info Title: Lower Bounds for Function Inversion with Quantum Advice ArXiv ID: 1911.09176 Date: 2020-04-09 Authors: Kai-Min Chung, Tai-Ning Liao, Luowen Qian 📝 Abstract Function inversion is the problem that given a random function $f: [M] …

April 09, 2020

Data Structures Quantum Physics Computer Science Cryptography and Security Computational Complexity

No Image

A Quadratic Lower Bound for Algebraic Branching Programs and Formulas

📝 Original Info Title: A Quadratic Lower Bound for Algebraic Branching Programs and Formulas ArXiv ID: 1911.11793 Date: 2020-03-19 Authors: Prerona Chatterjee, Mrinal Kumar, Adrian She, Ben Lee Volk 📝 Abstract We show that any Algebraic Branching …

March 19, 2020

Computational Complexity Computer Science

Bipartite Perfect Matching as a Real Polynomial

📝 Original Info Title: Bipartite Perfect Matching as a Real Polynomial ArXiv ID: 2001.07642 Date: 2020-02-25 Authors: Gal Beniamini and Noam Nisan 📝 Abstract We obtain a description of the Bipartite Perfect Matching decision problem as a multilinear …

February 25, 2020

Computational Complexity Computer Science Discrete Mathematics

Capacity Approaching Coding for Low Noise Interactive Quantum Communication, Part I: Large Alphabets

📝 Original Info Title: Capacity Approaching Coding for Low Noise Interactive Quantum Communication, Part I: Large Alphabets ArXiv ID: 2001.02818 Date: 2020-01-10 Authors: Debbie Leung, Ashwin Nayak, Ala Shayeghi, Dave Touchette, Penghui Yao, Nengkun …

January 10, 2020

Data Structures Quantum Physics Computer Science Computational Complexity Information Theory Mathematics

Hypergraph Cuts with General Splitting Functions

📝 Original Info Title: Hypergraph Cuts with General Splitting Functions ArXiv ID: 2001.02817 Date: 2020-01-10 Authors: Nate Veldt and Austin R. Benson and Jon Kleinberg 📝 Abstract The minimum $s$-$t$ cut problem in graphs is one of the most …

January 10, 2020

Computational Complexity Data Structures Computer Science Discrete Mathematics

EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 2: EXPSPACE-Hardness

📝 Original Info Title: EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 2: EXPSPACE-Hardness ArXiv ID: 1908.03509 Date: 2019-08-12 Authors: Peter Hertling and Gisela Krommes 📝 Abstract It is known that the …

August 12, 2019

Computational Complexity Mathematics Logic Computer Science

Parameterized complexity of finding a spanning tree with minimum reload cost diameter

📝 Original Info Title: Parameterized complexity of finding a spanning tree with minimum reload cost diameter ArXiv ID: 1703.01686 Date: 2017-04-25 Authors: Julien Baste, Didem G’oz’upek, Christophe Paul, Ignasi Sau, Mordechai Shalom, …

April 25, 2017

Computational Complexity Data Structures Computer Science

A Hierarchy of Lower Bounds for Sublinear Additive Spanners

📝 Original Info Title: A Hierarchy of Lower Bounds for Sublinear Additive Spanners ArXiv ID: 1607.07497 Date: 2017-01-11 Authors: Amir Abboud, Greg Bodwin, and Seth Pettie 📝 Abstract Spanners, emulators, and approximate distance oracles can be viewed …

January 11, 2017

Data Structures Computer Science Computational Complexity Mathematics Discrete Mathematics

No Image

A No-Go Theorem for Derandomized Parallel Repetition: Beyond Feige-Kilian

📝 Original Info Title: A No-Go Theorem for Derandomized Parallel Repetition: Beyond Feige-Kilian ArXiv ID: 1607.07130 Date: 2016-07-26 Authors: Dana Moshkovitz, Govind Ramnarayan, Henry Yuen 📝 Abstract In this work we show a barrier towards proving a …

July 26, 2016

Computational Complexity Computer Science

Computational Complexity

LDPC Codes Achieve List Decoding Capacity

The Complexity of Contracting Planar Tensor Network

Colouring graphs with constraints on connectivity

The Complexity of Online Bribery in Sequential Elections

Hitting minors on bounded treewidth graphs. IV. An optimal algorithm

Edge Matching with Inequalities, Triangles, Unknown Shape, and Two Players

The Lagrangian remainder of Taylors series, distinguishes $mathcal{O}(f(x))$ time complexities to polynomials or not

Approximate counting CSP seen from the other side

Lower Bounds for Function Inversion with Quantum Advice

A Quadratic Lower Bound for Algebraic Branching Programs and Formulas

Bipartite Perfect Matching as a Real Polynomial

Capacity Approaching Coding for Low Noise Interactive Quantum Communication, Part I: Large Alphabets

Hypergraph Cuts with General Splitting Functions

EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 2: EXPSPACE-Hardness

Parameterized complexity of finding a spanning tree with minimum reload cost diameter

A Hierarchy of Lower Bounds for Sublinear Additive Spanners

A No-Go Theorem for Derandomized Parallel Repetition: Beyond Feige-Kilian

< Category Statistics (Total: 1595) >

Table of Contents

Table of Contents

LDPC Codes Achieve List Decoding Capacity

The Complexity of Contracting Planar Tensor Network

Colouring graphs with constraints on connectivity

The Complexity of Online Bribery in Sequential Elections

Hitting minors on bounded treewidth graphs. IV. An optimal algorithm

Edge Matching with Inequalities, Triangles, Unknown Shape, and Two Players

The Lagrangian remainder of Taylors series, distinguishes $mathcal{O}(f(x))$ time complexities to polynomials or not

Approximate counting CSP seen from the other side

Lower Bounds for Function Inversion with Quantum Advice

A Quadratic Lower Bound for Algebraic Branching Programs and Formulas

Bipartite Perfect Matching as a Real Polynomial

Capacity Approaching Coding for Low Noise Interactive Quantum Communication, Part I: Large Alphabets

Hypergraph Cuts with General Splitting Functions

EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 2: EXPSPACE-Hardness

Parameterized complexity of finding a spanning tree with minimum reload cost diameter

A Hierarchy of Lower Bounds for Sublinear Additive Spanners

A No-Go Theorem for Derandomized Parallel Repetition: Beyond Feige-Kilian

< Category Statistics (Total: 1595) >

Start searching

No results found