The following pages link to (Q4718423):
Displayed 17 items.
- Symmetry groups of Boolean functions. (Q402450) (← links)
- Lifting lower bounds for tree-like proofs (Q475337) (← links)
- On finding short resolution refutations and small unsatisfiable subsets (Q820148) (← links)
- Phase transitions for Gödel incompleteness (Q1006619) (← links)
- A characterization of polynomial time computable functions from the integers to the reals using discrete ordinary differential equations (Q2104133) (← links)
- Polynomial time relatively computable triangular arrays for almost sure convergence (Q2315247) (← links)
- Finding a vector orthogonal to roughly half a collection of vectors (Q2479315) (← links)
- On the Proof Complexity of Cut-Free Bounded Deep Inference (Q3010365) (← links)
- Characterization of zigzag De Morgan functions (Q3178160) (← links)
- Squeezing Feasibility (Q3188242) (← links)
- On Negations in Boolean Networks (Q3644711) (← links)
- Rethinking arithmetic for deep neural networks (Q4993501) (← links)
- A Subatomic Proof System for Decision Trees (Q5056373) (← links)
- A recursion-theoretic characterisation of the positive polynomial-time functions (Q5079742) (← links)
- (Q5208872) (← links)
- Space Hardness of Solving Structured Linear Systems. (Q6065465) (← links)
- A characterization of functions over the integers computable in polynomial time using discrete ordinary differential equations (Q6116835) (← links)