Noriko H. Arai

Available identifiers

Publication	Date of Publication	Type
Can an A.I. win a medal in the mathematical olympiad? – Benchmarking mechanized mathematics on pre-university problems1	2021-01-20	Paper
Race Against the Teens – Benchmarking Mechanized Math on Pre-university Problems	2016-09-05	Paper
Mathematics by machine	2015-11-11	Paper
The complexity of analytic tableaux	2015-02-27	Paper
Polynomal-size Frege proofs of Bollobás' theorem on the trace of sets	2009-01-13	Paper
The complexity of analytic tableaux	2006-11-29	Paper
How to find symmetries hidden in combinatorial problems	2001-10-21	Paper
https://portal.mardi4nfdi.de/entity/Q2721182	2001-07-01	Paper
https://portal.mardi4nfdi.de/entity/Q4503949	2001-05-14	Paper
Relative efficiency of propositional proof systems: Resolution vs. cut-free LK	2000-09-04	Paper
No feasible monotone interpolation for simple combinatorial reasoning	2000-08-21	Paper
Tractability of cut-free Gentzen-type propositional calculus with permutation inference. II	2000-08-21	Paper
https://portal.mardi4nfdi.de/entity/Q4252655	1999-11-08	Paper
https://portal.mardi4nfdi.de/entity/Q4253348	1999-11-08	Paper
Tractability of cut-free Gentzen type propositional calculus with permutation inference	1997-02-27	Paper
A proper hierarchy of propositional sequent calculi	1997-02-27	Paper
Cut-free LK quasi-polynomially simulates resolution	N/A	Paper

This page was built for person: Noriko H. Arai