Rahul Santhanam

1. Pseudodeterministic Constructions in Subexponential Time
   2016/12/06 by Igor Carboni Oliveira, Rahul Santhanam, Oliveira, Igor C. +1 · 3 citations
   Computer Science · #Complexity and Algorithms in Graphs #Computability, Logic, AI Algorithms #semigroups and automata theory
2. Polynomial-Time Pseudodeterministic Construction of Primes
   2023/05/24 by Lijie Chen, Zhenjian Lu, Chen, Lijie +7 · 4 citations
   Computer Science · #Algorithms and Data Compression #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #semigroups and automata theory
3. Beyond Natural Proofs: Hardness Magnification and Locality
   2019/11/19 by Lijie Chen, Shuichi Hirahara, Chen, Lijie +9 · 2 citations
   Computer Science · Engineering · #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Cryptography and Data Security #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Low-power high-performance VLSI design