The following pages link to Noriko H. Arai (Q672045):
Displaying 17 items.
- Tractability of cut-free Gentzen type propositional calculus with permutation inference (Q672046) (← links)
- A proper hierarchy of propositional sequent calculi (Q1350509) (← links)
- (Q1575264) (redirect page) (← links)
- No feasible monotone interpolation for simple combinatorial reasoning (Q1575265) (← links)
- Tractability of cut-free Gentzen-type propositional calculus with permutation inference. II (Q1575637) (← links)
- Relative efficiency of propositional proof systems: Resolution vs. cut-free LK (Q1577476) (← links)
- Polynomal-size Frege proofs of Bollobás' theorem on the trace of sets (Q2378659) (← links)
- (Q2721182) (← links)
- (Q2751534) (← links)
- Race Against the Teens – Benchmarking Mechanized Math on Pre-university Problems (Q2817922) (← links)
- The complexity of analytic tableaux (Q3410672) (← links)
- Mathematics by machine (Q3452371) (← links)
- (Q4252655) (← links)
- (Q4253348) (← links)
- (Q4503949) (← links)
- Can an A.I. win a medal in the mathematical olympiad? – Benchmarking mechanized mathematics on pre-university problems1 (Q5145435) (← links)
- The complexity of analytic tableaux (Q5175990) (← links)