Relating Partial and Complete Solutions and the Complexity of Computing Smallest Solutions
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Optimal satisfiability for propositional calculi and constraint satisfaction problems
Information and Computation
On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P
Information Processing Letters
Note: The complexity of power-index comparison
Theoretical Computer Science
The complexity of counting functions with easy decision version
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Survey: The consequences of eliminating NP solutions
Computer Science Review
Hi-index | 0.00 |