Pages that link to "Item:Q693058"

The following pages link to On optimal heuristic randomized semidecision procedures, with applications to proof complexity and cryptography (Q693058):

Displaying 4 items.

• Towards NP-P via proof complexity and search (Q408544) (← links)
• On an optimal randomized acceptor for graph nonisomorphism (Q413276) (← links)
• Optimal heuristic algorithms for the image of an injective function (Q1946839) (← links)
• A remark on pseudo proof systems and hard instances of the satisfiability problem (Q5109236) (← links)