Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Transactions on Computation Theory, Volume 9
Volume 9, Number 1, December 2016
- Pavel Hrubes:
On Hardness of Multilinearization and VNP-Completeness in Characteristic 2. 1:1-1:14 - Andreas Krebs, Nutan Limaye, Meena Mahajan
, Karteek Sreenivasaiah:
Small Depth Proof Systems. 2:1-2:26 - Vikraman Arvind, Pushkar S. Joglekar, S. Raja:
Noncommutative Valiant's Classes: Structure and Complete Problems. 3:1-3:29 - Lila Fontes, Rahul Jain, Iordanis Kerenidis, Sophie Laplante, Mathieu Laurière, Jérémie Roland:
Relative Discrepancy Does Not Separate Information and Communication Complexity. 4:1-4:15 - Paul Beame, Nathan Grosshans, Pierre McKenzie, Luc Segoufin:
Nondeterminism and An Abstract Formulation of Nečiporuk's Lower Bound Method. 5:1-5:34
Volume 9, Number 2, May 2017
- Sergei Artemenko, Ronen Shaltiel:
Pseudorandom Generators with Optimal Seed Length for Non-Boolean Poly-Size Circuits. 6:1-6:26 - Arnab Bhattacharyya, Sivakanth Gopi:
Lower Bounds for Constant Query Affine-Invariant LCCs and LTCs. 7:1-7:17 - Rohit Gurjar, Arpita Korwar, Jochen Messner, Thomas Thierauf:
Exact Perfect Matching in Complete Graphs. 8:1-8:20 - Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum:
A Complexity Trichotomy for Approximately Counting List H-Colorings. 9:1-9:22 - Anant Dhayal, Jayalal Sarma, Saurabh Sawlani:
Min/Max-Poly Weighting Schemes and the NL versus UL Problem. 10:1-10:25
Volume 9, Number 3, October 2017
- Hubie Chen, Benoît Larose:
Asking the Metaquestions in Constraint Tractability. 11:1-11:27 - Michael Elberfeld, Pascal Schweitzer:
Canonizing Graphs of Bounded Tree Width in Logspace. 12:1-12:29 - Markus L. Schmid:
Finding Consensus Strings with Small Length Difference between Input and Solution Strings. 13:1-13:18 - Anna Adamaszek, Tomasz Kociumaka, Marcin Pilipczuk, Michal Pilipczuk:
Hardness of Approximation for Strip Packing. 14:1-14:7 - Hubie Chen:
Proof Complexity Modulo the Polynomial Hierarchy: Understanding Alternation as a Source of Hardness. 15:1-15:20
Volume 9, Number 4, January 2018
- Kazuo Iwama, Yuichi Yoshida:
Parameterized Testability. 16:1-16:16 - Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, Nithin Varma:
Parameterized Property Testing of Functions. 17:1-17:19 - Michal Pilipczuk, Marcin Wrochna:
On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs. 18:1-18:36 - Diptarka Chakraborty, Raghunath Tewari:
An O(nε) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs. 19:1-19:11 - Ching-Lueh Chang:
Metric 1-Median Selection: Query Complexity vs. Approximation Ratio. 20:1-20:23
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 2024-04-22 20:02 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:
