Articles under category:
Hitting Set: Theory of Computing: An Open Access Electronic Journal in Theoretical Computer Science

Articles under category:
Hitting Set

Vol 19, Article 12 (pp 1-30)
Near-Optimal Bootstrapping of Hitting Sets for Algebraic Models
by Mrinal Kumar, Ramprasad Saptharishi, and Anamay Tengse

Vol 19, Article 4 (pp 1-61) [CCC20 Spec Issue]
Non-Disjoint Promise Problems from Meta-Computational View of Pseudorandom Generator Constructions
by Shuichi Hirahara

Vol 18, Article 21 (pp 1-32) [CCC20 Spec Issue]
Hitting Sets Give Two-Sided Derandomization of Small Space
by Kuan Cheng and William M. Hoza

Vol 15, Article 16 (pp 1-30) [CCC18 Spec Issue]
Algebraic Dependencies and PSPACE Algorithms in Approximative Complexity over Any Field
by Zeyu Guo, Nitin Saxena, and Amit Sinhababu

Vol 13, Article 6 (pp 1-33) [CCC16 Spec Issue]
Arithmetic Circuits with Locally Low Algebraic Rank
by Mrinal Kumar and Shubhangi Saraf

Vol 13, Article 2 (pp 1-21) [CCC16 Spec Issue]
Identity Testing for Constant-Width, and Any-Order, Read-Once Oblivious Arithmetic Branching Programs
by Rohit Gurjar, Arpita Korwar, and Nitin Saxena

Vol 9, Article 13 (pp 441-470) [APRX-RND12 Spec Issue]
Optimal Hitting Sets for Combinatorial Shapes
by Aditya Bhaskara, Devendra Desai, and Srikanth Srinivasan

Vol 8, Article 11 (pp 239-267)
Tight Bounds on the Approximability of Almost-Satisfiable Horn SAT and Exact Hitting Set
by Venkatesan Guruswami and Yuan Zhou