Pages that link to "Item:Q4369864"

The following pages link to Designing programs that check their work (Q4369864):

Displaying 24 items.

• Locality and Checkability in Wait-Free Computing (Q3095336) (← links)
• Program result checking against adaptive programs and in cryptographic settings (Q3212297) (← links)
• On the Complexity of the Hidden Subgroup Problem (Q3502634) (← links)
• Software reliability via run-time result-checking (Q4208876) (← links)
• Program result checking: A new approach to making programs more reliable (Q4630244) (← links)
• Outlaw distributions and locally decodable codes (Q4638069) (← links)
• The Journey from NP to TFNP Hardness (Q4638115) (← links)
• Self-correcting for function fields of finite transcendental degree (Q4645210) (← links)
• A CASE STUDY IN ALGORITHM ENGINEERING FOR GEOMETRIC COMPUTING (Q4682177) (← links)
• High-entropy dual functions over finite fields and locally decodable codes (Q4965879) (← links)
• Foundations of Homomorphic Secret Sharing (Q4993284) (← links)
• (Q5002633) (← links)
• Cogent: uniqueness types and certifying compilation (Q5019022) (← links)
• Farkas Certificates and Minimal Witnesses for Probabilistic Reachability Constraints (Q5039515) (← links)
• An information-theoretic treatment of random-self-reducibility (Q5048951) (← links)
• Checking the convexity of polytopes and the planarity of subdivisions (extended abstract) (Q5096937) (← links)
• ON THE COMPLEXITY OF THE HIDDEN SUBGROUP PROBLEM (Q5168412) (← links)
• AUTOMATIC RESULT VERIFICATION BY COMPLETE RUN-TIME CHECKING OF COMPUTATIONS (Q5249251) (← links)
• Quasi-random words and limits of word sequences (Q5918087) (← links)
• A nonadaptive NC checker for permutation group intersection (Q5941295) (← links)
• Linear-consistency testing. (Q5946056) (← links)
• (Q6084351) (← links)
• Testing membership for timed automata (Q6090987) (← links)
• \(\mathrm{MIP}^* = \mathrm{RE}\): a negative resolution to Connes' embedding problem and Tsirelson's problem (Q6118161) (← links)