Pages that link to "Item:Q892235"
From MaRDI portal
The following pages link to Computer-aided proof of Erdős discrepancy properties (Q892235):
Displaying 17 items.
- Optimal-depth sorting networks (Q340576) (← links)
- A nonexistence certificate for projective planes of order ten with weight 15 codewords (Q780361) (← links)
- On computer-assisted proofs in ordinal number theory (Q1284712) (← links)
- Non-clausal redundancy properties (Q2055860) (← links)
- Covered clauses are not propagation redundant (Q2096437) (← links)
- Simulating strong practical proof systems with extended resolution (Q2209554) (← links)
- \texttt{cake\_lpr}: verified propagation redundancy checking in CakeML (Q2233509) (← links)
- Strong extension-free proof systems (Q2303251) (← links)
- Formally verifying the solution to the Boolean Pythagorean triples problem (Q2323449) (← links)
- Functional Encryption for Inner Product with Full Function Privacy (Q2798775) (← links)
- The Erdös discrepancy problem (Q2826233) (← links)
- Decomposing SAT Instances with Pseudo Backbones (Q3304190) (← links)
- Nonexistence Certificates for Ovals in a Projective Plane of Order Ten (Q5041183) (← links)
- (Q5433687) (← links)
- The resolution of Keller's conjecture (Q5918545) (← links)
- The resolution of Keller's conjecture (Q5970770) (← links)
- Computer-aided constructions of commafree codes (Q6156641) (← links)