![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 245 matches
- 2024
- Joshua A. Grochow
, Youming Qiao
:
On p-Group Isomorphism: Search-to-Decision, Counting-to-Decision, and Nilpotency Class Reductions via Tensors. ACM Trans. Comput. Theory 16(1): 2:1-2:39 (2024) - Bart M. P. Jansen
, Michal Wlodarczyk
:
Optimal Polynomial-Time Compression for Boolean Max CSP. ACM Trans. Comput. Theory 16(1): 4:1-4:20 (2024) - Adam Kurpisz
, Samuli Leppänen
, Monaldo Mastrolilli
:
Tight Sum-of-squares Lower Bounds for Binary Polynomial2 Optimization Problems. ACM Trans. Comput. Theory 16(1): 3:1-3:16 (2024) - Ashley Montanaro
, Changpeng Shao
:
Quantum Communication Complexity of Linear Regression. ACM Trans. Comput. Theory 16(1): 1:1-1:30 (2024) - 2023
- Prerona Chatterjee
, Ramprasad Saptharishi
:
Constructing Faithful Homomorphisms over Fields of Finite Characteristic. ACM Trans. Comput. Theory 15(1-2): 1-19 (2023) - Lukás Folwarczný
:
On Protocols for Monotone Feasible Interpolation. ACM Trans. Comput. Theory 15(1-2): 1-17 (2023) - Yassine Hamoudi
, Frédéric Magniez
:
Quantum Time-Space Tradeoff for Finding Multiple Collision Pairs. ACM Trans. Comput. Theory 15(1-2): 1-22 (2023) - 2022
- Vikraman Arvind
, Frank Fuhlbrück
, Johannes Köbler
, Sebastian Kuhnert
, Gaurav Rattan
:
The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs. ACM Trans. Comput. Theory 14(2): 9:1-9:26 (2022) - Laurent Bartholdi
, Michael Figelius
, Markus Lohrey
, Armin Weiß
:
Groups with ALOGTIME-hard Word Problems and PSPACE-complete Compressed Word Problems. ACM Trans. Comput. Theory 14(3-4): 1-41 (2022) - Samir Datta
, Nutan Limaye
, Prajakta Nimbhorkar
, Thomas Thierauf
, Fabian Wagner
:
Planar Graph Isomorphism Is in Log-Space. ACM Trans. Comput. Theory 14(2): 8:1-8:33 (2022) - Fedor V. Fomin
, Petr A. Golovach
, Giannos Stamoulis
, Dimitrios M. Thilikos
:
An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL. ACM Trans. Comput. Theory 14(3-4): 1-29 (2022) - Andreas Galanis
, Heng Guo
, Jiaheng Wang
:
Inapproximability of Counting Hypergraph Colourings. ACM Trans. Comput. Theory 14(3-4): 1-33 (2022) - Xuangui Huang
, Emanuele Viola
:
Approximate Degree, Weight, and Indistinguishability. ACM Trans. Comput. Theory 14(1): 3:1-3:26 (2022) - Victor Lagerkvist, Magnus Wahlström:
The (Coarse) Fine-Grained Structure of NP-Hard SAT and CSP Problems. ACM Trans. Comput. Theory 14(1): 2:1-2:54 (2022) - Amit Levi
, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova
, Nithin Varma
:
Erasure-Resilient Sublinear-Time Graph Algorithms. ACM Trans. Comput. Theory 14(1): 1:1-1:22 (2022) - Frédéric Magniez
, Ashwin Nayak
:
Quantum Distributed Complexity of Set Disjointness on a Line. ACM Trans. Comput. Theory 14(1): 5:1-5:22 (2022) - Tamio-Vesa Nakajima
, Stanislav Zivný
:
Linearly Ordered Colourings of Hypergraphs. ACM Trans. Comput. Theory 14(3-4): 1-19 (2022) - Dana Ron
, Asaf Rosin
:
Optimal Distribution-Free Sample-Based Testing of Subsequence-Freeness with One-Sided Error. ACM Trans. Comput. Theory 14(1): 4:1-4:31 (2022) - Noah Singer
, Madhu Sudan
:
Point-hyperplane Incidence Geometry and the Log-rank Conjecture. ACM Trans. Comput. Theory 14(2): 7:1-7:16 (2022) - Ben Lee Volk
, Mrinal Kumar
:
A Polynomial Degree Bound on Equations for Non-rigid Matrices and Small Linear Circuits. ACM Trans. Comput. Theory 14(2): 6:1-6:14 (2022) - 2021
- Andris Ambainis, Martins Kokainis, Krisjanis Prusis, Jevgenijs Vihrovs, Aleksejs Zajakins:
All Classical Adversary Methods Are Equivalent for Total Functions. ACM Trans. Comput. Theory 13(1): 7:1-7:20 (2021) - Srinivasan Arunachalam, Sourav Chakraborty, Michal Koucký
, Nitin Saurabh, Ronald de Wolf:
Improved Bounds on Fourier Entropy and Min-entropy. ACM Trans. Comput. Theory 13(4): 22:1-22:40 (2021) - 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. ACM Trans. Comput. Theory 13(1): 4:1-4:31 (2021) - Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic:
The Complexity of Approximating the Matching Polynomial in the Complex Plane. ACM Trans. Comput. Theory 13(2): 13:1-13:37 (2021) - Alex Brandts, Marcin Wrochna
, Stanislav Zivný:
The Complexity of Promise SAT on Non-Boolean Domains. ACM Trans. Comput. Theory 13(4): 26:1-26:20 (2021) - Robert Bredereck, Piotr Faliszewski
, Rolf Niedermeier, Nimrod Talmon:
Complexity of Shift Bribery in Committee Elections. ACM Trans. Comput. Theory 13(3): 20:1-20:25 (2021) - Mark Bun, Nikhil S. Mande
, Justin Thaler:
Sign-rank Can Increase under Intersection. ACM Trans. Comput. Theory 13(4): 24:1-24:17 (2021) - Jin-yi Cai, Artem Govorov:
On a Theorem of Lovász that (&sdot, H) Determines the Isomorphism Type of H. ACM Trans. Comput. Theory 13(2): 11:1-11:25 (2021) - Prasad Chaugule, Nutan Limaye, Aditya Varre:
Variants of Homomorphism Polynomials Complete for Algebraic Complexity Classes. ACM Trans. Comput. Theory 13(4): 21:1-21:26 (2021) - Suryajith Chillara:
On Computing Multilinear Polynomials Using Multi-r-ic Depth Four Circuits. ACM Trans. Comput. Theory 13(3): 16:1-16:21 (2021)
skipping 215 more matches
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-08-23 03:56 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint