Pages that link to "Item:Q884465"

The following pages link to Classes of representable disjoint \textsf{NP}-pairs (Q884465):

Displaying 9 items.

• Nondeterministic functions and the existence of optimal proof systems (Q837177) (← links)
• Tuples of disjoint \(\mathsf{NP}\)-sets (Q929286) (← links)
• The deduction theorem for strong propositional proof systems (Q987382) (← links)
• Proof system representations of degrees of disjoint NP-pairs (Q1944897) (← links)
• Total nondeterministic Turing machines and a p-optimal proof system for SAT (Q2011675) (← links)
• Do there exist complete sets for promise classes? (Q3107337) (← links)
• Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes (Q3392941) (← links)
• Logical Closure Properties of Propositional Proof Systems (Q3502657) (← links)
• On the correspondence between arithmetic theories and propositional proof systems – a survey (Q3619867) (← links)