Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Transactions on Computation Theory, Volume 13
Volume 13, Number 1, March 2021
- John M. Hitchcock, Adewale Sekoni, Hadi Shafei:
Polynomial-Time Random Oracles and Separating Complexity Classes. 11-16
- Peter Jonsson, Victor Lagerkvist, Biman Roy:
Fine-Grained Time Complexity of Constraint Satisfaction Problems. 2:1-2:32 - William Kretschmer:
Lower Bounding the AND-OR Tree via Symmetrization. 3:1-3:11 - Florent Becker, Tom Besson, Jérôme Durand-Lose
, Aurélien Emmanuel, Mohammad-Hadi Foroughmand-Araabi, Sama Goliaei, Shahrzad Heydarshahi:
Abstract Geometrical Computation 10: An Intrinsically Universal Family of Signal Machines. 4:1-4:31 - Emanuele Viola:
AC0 Unpredictability. 5:1-5:8 - Dmitry Itsykson, Alexander Okhotin, Vsevolod Oparin:
Computational and Proof Complexity of Partial String Avoidability. 6:1-6:25 - Andris Ambainis, Martins Kokainis, Krisjanis Prusis, Jevgenijs Vihrovs, Aleksejs Zajakins:
All Classical Adversary Methods Are Equivalent for Total Functions. 7:1-7:20
Volume 13, Number 2, June 2021
- Holger Dell, John Lapinskas:
Fine-Grained Reductions from Approximate Counting to Decision. 8:1-8:24 - Sushmita Gupta, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Popular Matching in Roommates Setting Is NP-hard. 9:1-9:20 - Fedor V. Fomin, Daniel Lokshtanov, Ivan Mihajlin, Saket Saurabh, Meirav Zehavi:
Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds. 10:1-10:25 - Jin-yi Cai, Artem Govorov:
On a Theorem of Lovász that (&sdot, H) Determines the Isomorphism Type of H. 11:1-11:25 - Qian Li, Xiaoming Sun:
On the Sensitivity Complexity of k-Uniform Hypergraph Properties. 12:1-12:13 - Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic:
The Complexity of Approximating the Matching Polynomial in the Complex Plane. 13:1-13:37
Volume 13, Number 3, September 2021
- Neil Lutz:
Fractal Intersections and Products via Algorithmic Dimension. 14:1-14:15 - Suryajith Chillara:
On Computing Multilinear Polynomials Using Multi-r-ic Depth Four Circuits. 16:1-16:21 - Akihiro Monde, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita:
Can a Skywalker Localize the Midpoint of a Rope? 17:1-17:23 - Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Multiplicative Parameterization Above a Guarantee. 18:1-18:16 - Andreas Göbel, J. A. Gregor Lagodzinski, Karen Seidel:
Counting Homomorphisms to Trees Modulo a Prime. 19:1-19:33 - Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Complexity of Shift Bribery in Committee Elections. 20:1-20:25
Volume 13, Number 4, December 2021
- Prasad Chaugule, Nutan Limaye, Aditya Varre:
Variants of Homomorphism Polynomials Complete for Algebraic Complexity Classes. 21:1-21:26 - Srinivasan Arunachalam, Sourav Chakraborty, Michal Koucký, Nitin Saurabh, Ronald de Wolf:
Improved Bounds on Fourier Entropy and Min-entropy. 22:1-22:40 - Valentine Kabanets, Sajin Koroth, Zhenjian Lu, Dimitrios Myrisiotis, Igor C. Oliveira:
Algorithms and Lower Bounds for De Morgan Formulas of Low-Communication Leaf Gates. 23:1-23:37 - Mark Bun, Nikhil S. Mande, Justin Thaler:
Sign-rank Can Increase under Intersection. 24:1-24:17 - Andreas Galanis, Leslie Ann Goldberg, James Stewart:
Fast Algorithms for General Spin Systems on Bipartite Expanders. 25:1-25:18 - Alex Brandts, Marcin Wrochna, Stanislav Zivný:
The Complexity of Promise SAT on Non-Boolean Domains. 26:1-26:20 - Spoorthy Gunda, Pallavi Jain, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale:
On the Parameterized Approximability of Contraction to Classes of Chordal Graphs. 27:1-27:40
a service of 
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 2023-09-29 22:05 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:
