Stephen Travers

Available identifiers

zbMath Open travers.stephen-dMaRDI QIDQ553310

List of research outcomes

Publication	Date of Publication	Type
Perfect correspondences between dot-depth and polynomial-time hierarchies	2014-06-10	Paper
Unions of Disjoint NP-Complete Sets	2011-08-17	Paper
The fault tolerance of NP-hard problems	2011-07-27	Paper
Satisfiability of algebraic circuits over sets of natural numbers	2010-08-13	Paper
Equivalence problems for circuits over sets of natural numbers	2010-03-05	Paper
Machines that can output empty words	2009-08-06	Paper
Non-mitotic sets	2009-05-28	Paper
The Fault Tolerance of NP-Hard Problems	2009-04-02	Paper
Perfect Correspondences Between Dot-Depth and Polynomial-Time Hierarchy	2009-03-26	Paper
The complexity of unions of disjoint sets	2008-11-19	Paper
Equivalence Problems for Circuits over Sets of Natural Numbers	2008-06-03	Paper
Satisfiability of Algebraic Circuits over Sets of Natural Numbers	2008-04-24	Paper
Non-mitotic Sets	2008-04-24	Paper
Machines that Can Output Empty Words	2007-09-05	Paper
The Complexity of Unions of Disjoint Sets	2007-09-03	Paper
The complexity of membership problems for circuits over sets of integers	2007-01-09	Paper
Mathematical Foundations of Computer Science 2004	2005-08-22	Paper

Research outcomes over time

This page was built for person: Stephen Travers