PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "yi Cai, Jin"

Author of the publication

copydeleteadd this publication to your clipboard
Pseudorandom Generators, Measure Theory, and Natural Proofs

, , and . Electronic Colloquium on Computational Complexity (ECCC), (1995)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Yi Wang University of Stuttgart

Dr. Xinxin Jing University of Stuttgart

Seda Yilmaz University of Stuttgart

Emre Baris Yildiz University of Stuttgart

Zeynep Hazal Yilmaz University of Stuttgart

 

Other publications of authors with the same name

The Complexity of Some Lattice Problems.. ANTS, volume 1838 of Lecture Notes in Computer Science, page 1-32. Springer, (2000)Approximation and hardness results for label cut and related problems., , , and . J. Comb. Optim., 21 (2): 192-208 (2011)On zero error algorithms having oracle access to one query., and . J. Comb. Optim., 11 (2): 189-202 (2006)Foreword., and . Algorithmica, 23 (4): 277 (1999)X-Diff: An Effective Change Detection Algorithm for XML Documents., , and . ICDE, page 519-530. IEEE Computer Society, (2003)Competing provers yield improved Karp-Lipton collapse results., , , and . Inf. Comput., 198 (1): 1-23 (2005)Valiant's Holant Theorem and Matchgate Tensors., and . TAMC, volume 3959 of Lecture Notes in Computer Science, page 248-261. Springer, (2006)Some Results on Matchgates and Holographic Algorithms., and . ICALP (1), volume 4051 of Lecture Notes in Computer Science, page 703-714. Springer, (2006)Holographic Algorithms Beyond Matchgates., , and . ICALP (1), volume 8572 of Lecture Notes in Computer Science, page 271-282. Springer, (2014)Graph Minimal Uncolorability is D^P-Complete., and . SIAM J. Comput., 16 (2): 259-277 (1987)