default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Transactions on Computation Theory, Volume 8
Volume 8, Number 1, February 2016
- Stefan Kratsch, Dániel Marx, Magnus Wahlström
:
Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems. 1:1-1:28 - Ilya Volkovich:
Characterizing Arithmetic Read-Once Formulae. 2:1-2:19 - Sylvain Schmitz:
Complexity Hierarchies beyond Elementary. 3:1-3:36 - Nir Ailon:
An Omega((n log n)/R) Lower Bound for Fourier Transform Computation in the R-Well Conditioned Model. 4:1-4:14
Volume 8, Number 2, May 2016
- Eldar Fischer, Yonatan Goldhirsh, Oded Lachish:
Testing Read-Once Formula Satisfaction. 5:1-5:26 - Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, Hadas Shachnai:
Tractable Parameterizations for the Minimum Linear Arrangement Problem. 6:1-6:12 - Oded Goldreich, Dana Ron:
On Sample-Based Testers. 7:1-7:54
Volume 8, Number 3, May 2016
- Mrinal Kumar, Gaurav Maheshwari, Jayalal Sarma:
Arithmetic Circuit Lower Bounds via Maximum-Rank of Partial Derivative Matrices. 8:1-8:17 - Peter Fulla, Stanislav Zivný:
A Galois Connection for Weighted (Relational) Clones of Infinite Size. 9:1-9:21 - Ishay Haviv, Oded Regev:
The List-Decoding Size of Fourier-Sparse Boolean Functions. 10:1-10:14 - Dung T. Nguyen, Alan L. Selman:
Structural Properties of Nonautoreducible Sets. 11:1-11:24 - Andreas Göbel, Leslie Ann Goldberg, David Richerby:
Counting Homomorphisms to Square-Free Graphs, Modulo 2. 12:1-12:29
Volume 8, Number 4, July 2016
- Ioannis Caragiannis, Christos Kaklamanis, Maria Kyropoulou:
Limitations of Deterministic Auction Design for Correlated Bidders. 13:1-13:18 - Rohit Gurjar, Arpita Korwar, Jochen Messner, Simon Straub, Thomas Thierauf:
Planarizing Gadgets for Perfect Matching Do Not Exist. 14:1-14:15 - Dana Ron, Gilad Tsur:
The Power of an Example: Hidden Set Size Approximation Using Group Queries and Conditional Sampling. 15:1-15:19 - Anna Gál, Jing-Tang Jang, Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah:
Space-Efficient Approximations for Subset Sum. 16:1-16:28 - Massimo Lauria:
A Rank Lower Bound for Cutting Planes Proofs of Ramsey's Theorem. 17:1-17:13 - Emanuele Viola:
Quadratic Maps Are Hard to Sample. 18:1-18:4
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-12-23 19:37 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:
