| Publication | Date of Publication | Type |
|---|
Colored hypergraph isomorphism is fixed parameter tractable
Algorithmica | 2015-03-02 | Paper |
| Colored hypergraph isomorphism is fixed parameter tractable | 2012-08-29 | Paper |
Computational complexity of computing a partial solution for the graph automorphism problems
Theoretical Computer Science | 2009-05-28 | Paper |
Relating Complete and Partial Solution for Problems Similar to Graph Automorphism
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs
Discrete Applied Mathematics | 2005-02-23 | Paper |
The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes.
Theoretical Computer Science | 2003-08-17 | Paper |
| scientific article; zbMATH DE number 1834679 (Why is no real title available?) | 2002-11-25 | Paper |
Simple characterizations of \(P(\# P)\) and complete problems
Journal of Computer and System Sciences | 2000-08-14 | Paper |
| scientific article; zbMATH DE number 1405675 (Why is no real title available?) | 2000-07-20 | Paper |
| scientific article; zbMATH DE number 1414313 (Why is no real title available?) | 2000-03-16 | Paper |
| scientific article; zbMATH DE number 1398073 (Why is no real title available?) | 2000-02-03 | Paper |
| scientific article; zbMATH DE number 1379125 (Why is no real title available?) | 1999-12-15 | Paper |
| scientific article; zbMATH DE number 1379307 (Why is no real title available?) | 1999-12-15 | Paper |
| scientific article; zbMATH DE number 1322318 (Why is no real title available?) | 1999-11-08 | Paper |
| scientific article; zbMATH DE number 1301088 (Why is no real title available?) | 1999-06-15 | Paper |
On sets bounded truth-table reducible to $P$-selective sets
RAIRO - Theoretical Informatics and Applications | 1997-04-13 | Paper |
On closure properties of \(\#\text{P}\) in the context of \(\text{PF} \circ \#\text{P}\)
Journal of Computer and System Sciences | 1997-03-31 | Paper |
On the power of generalized Mod-classes
Mathematical Systems Theory | 1996-07-01 | Paper |
The complexity of selecting maximal solutions
Information and Computation | 1995-08-02 | Paper |
Space-efficient recognition of sparse self-reducible languages
Computational Complexity | 1995-05-14 | Paper |
On closure properties of GapP
Computational Complexity | 1995-05-14 | Paper |
Structural analysis of the complexity of inverse functions
Mathematical Systems Theory | 1993-05-17 | Paper |
Polynomial-time 1-Turing reductions from \(\#\)PH to \(\#\)P
Theoretical Computer Science | 1992-09-27 | Paper |
ON THE COMPLEXITY OF COMPUTING OPTIMAL SOLUTIONS
International Journal of Foundations of Computer Science | 1992-09-27 | Paper |
Turing machines with few accepting computations and low sets for PP
Journal of Computer and System Sciences | 1992-09-27 | Paper |
Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy
SIAM Journal on Computing | 1992-06-28 | Paper |
Restricted relativizations of probabilistic polynomial time
Theoretical Computer Science | 1992-06-28 | Paper |
On polynomial-time truth-table reducibility of intractable sets to P-selective sets
Mathematical Systems Theory | 1991-01-01 | Paper |
PP is as Hard as the Polynomial-Time Hierarchy
SIAM Journal on Computing | 1991-01-01 | Paper |
On the complexity of topological sorting
Information Processing Letters | 1990-01-01 | Paper |
Positive relativizations for log space computability
Theoretical Computer Science | 1990-01-01 | Paper |
\(\Sigma_ 2SPACE(n)\) is closed under complement
Journal of Computer and System Sciences | 1987-01-01 | Paper |
