default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Transactions on Computation Theory, Volume 14
Volume 14, Number 1, March 2022
- Amit Levi
, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, Nithin Varma:
Erasure-Resilient Sublinear-Time Graph Algorithms. 1:1-1:22 - Victor Lagerkvist, Magnus Wahlström:
The (Coarse) Fine-Grained Structure of NP-Hard SAT and CSP Problems. 2:1-2:54 - Xuangui Huang, Emanuele Viola:
Approximate Degree, Weight, and Indistinguishability. 3:1-3:26 - Dana Ron, Asaf Rosin:
Optimal Distribution-Free Sample-Based Testing of Subsequence-Freeness with One-Sided Error. 4:1-4:31 - Frédéric Magniez, Ashwin Nayak:
Quantum Distributed Complexity of Set Disjointness on a Line. 5:1-5:22
Volume 14, Number 2, June 2022
- Ben Lee Volk, Mrinal Kumar:
A Polynomial Degree Bound on Equations for Non-rigid Matrices and Small Linear Circuits. 6:1-6:14 - Noah Singer, Madhu Sudan:
Point-hyperplane Incidence Geometry and the Log-rank Conjecture. 7:1-7:16 - Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner:
Planar Graph Isomorphism Is in Log-Space. 8:1-8:33 - Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Sebastian Kuhnert, Gaurav Rattan:
The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs. 9:1-9:26
Volume 14, Numbers 3-4, December 2022
- Fedor V. Fomin, Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos:
An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL. 1-29 - Andreas Galanis, Heng Guo, Jiaheng Wang:
Inapproximability of Counting Hypergraph Colourings. 1-33 - Laurent Bartholdi, Michael Figelius, Markus Lohrey, Armin Weiß:
Groups with ALOGTIME-hard Word Problems and PSPACE-complete Compressed Word Problems. 1-41 - Tamio-Vesa Nakajima, Stanislav Zivný:
Linearly Ordered Colourings of Hypergraphs. 1-19
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.
last updated on 2025-01-28 22:20 CET 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:
