Recommendations
Introduction to Special Section on Probabilistic Proof Systems
The study of probabilistically verifiable proofs originated in the mid 1980s with the introduction of Interactive Proof Systems (IPs). The primary focus of research in this area in the '80s has been twofold: the role of zero-knowledge interactive proofs ...
FPT is characterized by useful obstruction sets: Connecting algorithms, kernels, and quasi-orders
Many graph problems were first shown to be fixed-parameter tractable using the results of Robertson and Seymour on graph minors. We show that the combination of finite, computable obstruction sets and efficient order tests is not just one way of ...
On some FPT problems without polynomial Turing compressions
AbstractAn impressive hardness theory which can prove compression lower bounds for a large number of FPT problems has been established under the assumption that NP ⊈ coNP/poly. However, there are no problems in FPT for which the existence of ...






Comments