Noriko H. Arai

MaRDI QIDQ672045zbMATH OpenORCIDWikidataFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Can an A.I. win a medal in the mathematical olympiad? -- Benchmarking mechanized mathematics on pre-university problems AI Communications	2021-01-20	Paper
Race against the teens -- benchmarking mechanized math on pre-university problems Automated Reasoning	2016-09-05	Paper
Mathematics by machine Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation	2015-11-11	Paper
The complexity of analytic tableaux Proceedings of the thirty-third annual ACM symposium on Theory of computing	2015-02-27	Paper
Polynomal-size Frege proofs of Bollobás' theorem on the trace of sets Proceedings of the Japan Academy. Series A	2009-01-13	Paper
The complexity of analytic tableaux Journal of Symbolic Logic	2006-11-29	Paper
How to find symmetries hidden in combinatorial problems	2001-10-21	Paper
scientific article; zbMATH DE number 1612537 (Why is no real title available?)	2001-07-01	Paper
scientific article; zbMATH DE number 1507229 (Why is no real title available?)	2001-05-14	Paper
Relative efficiency of propositional proof systems: Resolution vs. cut-free LK Annals of Pure and Applied Logic	2000-09-04	Paper
No feasible monotone interpolation for simple combinatorial reasoning Theoretical Computer Science	2000-08-21	Paper
Tractability of cut-free Gentzen-type propositional calculus with permutation inference. II Theoretical Computer Science	2000-08-21	Paper
scientific article; zbMATH DE number 1305948 (Why is no real title available?)	1999-11-08	Paper
scientific article; zbMATH DE number 1322330 (Why is no real title available?)	1999-11-08	Paper
Tractability of cut-free Gentzen type propositional calculus with permutation inference Theoretical Computer Science	1997-02-27	Paper
A proper hierarchy of propositional sequent calculi Theoretical Computer Science	1997-02-27	Paper
Cut-free LK quasi-polynomially simulates resolution (available as arXiv preprint)	N/A	Paper

Research outcomes over time

This page was built for person: Noriko H. Arai