Get started
Author

Stephen D. Travers

Observed name: Stephen Travers
Observed institution: University of Würzburg
OpenAlex ID: A5111900258
The complexity of membership problems for circuits over sets of integers
2006 · Stephen Travers · Theoretical Computer Science · 39
PDF
Equivalence Problems for Circuits over Sets of Natural Numbers
2008 · Christian Glaßer, Katrin Herr, et al. · Theory of Computing Systems · 11
The Complexity of Unions of Disjoint Sets
2007 · Christian Glaßer, Alan L. Selman, et al. · Springer eBooks · 8
PDF
Satisfiability of algebraic circuits over sets of natural numbers
2010 · Christian Glaßer, Christian Reitwießner, et al. · Discrete Applied Mathematics · 7
PDF
Equivalence Problems for Circuits over Sets of Natural Numbers
2007 · Christian Glaßer, Katrin Herr, et al. · Lecture notes in computer science · 6
Non-mitotic sets
2008 · Christian Glaßer, Alan L. Selman, et al. · Theoretical Computer Science · 4
The fault tolerance of NP-hard problems
2010 · Christian Glaßer, A. Pavan, et al. · Information and Computation · 3
PDF
Non-mitotic Sets
2007 · Christian Glaßer, Alan L. Selman, et al. · Lecture notes in computer science · 3
Satisfiability of Algebraic Circuits over Sets of Natural Numbers
2007 · Christian Glaßer, Christian Reitwießner, et al. · Lecture notes in computer science · 3
Machines that Can Output Empty Words
2006 · Christian Glaßer, Stephen Travers · Lecture notes in computer science · 2
The Fault Tolerance of NP-Hard Problems
2009 · Christian Glaßer, A. Pavan, et al. · Lecture notes in computer science · 1
The Complexity of Membership Problems for Circuits over Sets of Integers
2004 · Stephen D. Travers · Lecture notes in computer science · 1
Perfect correspondences between dot-depth and polynomial-time hierarchies
2014 · Christian Glaßer, Stephen Travers, et al. · Journal of Computer and System Sciences
PDF
Unions of Disjoint NP-Complete Sets
2011 · Christian Glaßer, John M. Hitchcock, et al. · Lecture notes in computer science
Perfect Correspondences Between Dot-Depth and Polynomial-Time Hierarchy
2006 · Christian Glaßer, Stephen Travers, et al. · Lecture notes in computer science
Non-Mitotic Sets.
2006 · Christian Glaßer, Alan L. Selman, et al. · Electronic colloquium on computational complexity
A Reducibility that Corresponds to Unbalanced Leaf-Language Classes
2005 · Christian Glaßer, Stephen D. Travers, et al.
Works count: 17
Citation count: 88
H-index: 5
I10-index: 2
Year
Topic
Type