External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Syntactic Separation of Subset Satisfiability Problems

Eric Allender, Martin Farach-Colton, Meng-Tsung Tsai. Syntactic Separation of Subset Satisfiability Problems. In Dimitris Achlioptas, László A. Végh, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA. Volume 145 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. [doi]

Authors

Eric Allender

This author has not been identified. Look up 'Eric Allender' in Google

Martin Farach-Colton

This author has not been identified. Look up 'Martin Farach-Colton' in Google

Meng-Tsung Tsai

This author has not been identified. Look up 'Meng-Tsung Tsai' in Google
runs on