Journal: Theory Comput. Syst.

Volume 46, Issue 1

1 -- 0Sergei N. Artëmov, Volker Diekert, Dima Grigoriev. Preface
2 -- 8Alexander Rybalov. Generic Complexity of Presburger Arithmetic
9 -- 26Meena Mahajan, Jayalal M. N. Sarma. On the Complexity of Matrix Rank and Rigidity
27 -- 58Artur Jez, Alexander Okhotin. Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth
59 -- 79Maxim A. Babenko. A Fast Algorithm for the Path 2-Packing Problem
80 -- 103Christian Glaßer, Katrin Herr, Christian Reitwießner, Stephen D. Travers, Matthias Waldherr. Equivalence Problems for Circuits over Sets of Natural Numbers
104 -- 119Benjamin Hoffmann, Mikhail Lifshits, Yury Lifshits, Dirk Nowotka. Maximal Intersection Queries in Randomized Input Models
120 -- 142Qi Cheng, Sergey P. Tarasov, Mikhail N. Vyalyi. Efficient Algorithms for Sparse Cyclotomic Integer Zero Testing
143 -- 156Harry Buhrman, Lance Fortnow, Michal Koucký, John D. Rogers, Nikolai K. Vereshchagin. Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible?