7 citations · 9 across the 2 of their papers we have counts for
4 papers
The Computational Complexity of Propositional Cirquent Calculus
Matthew Steven Bauer
Introduced in 2006 by Japaridze, cirquent calculus is a refinement of sequent calculus. The advent of cirquent calculus arose from the need for a deductive system with a more expli…
An Infinite Class of Sparse-Yao Spanners
Matthew Bauer, Mirela Damian
We show that, for any integer k > 5, the Sparse-Yao graph YY_{6k} (also known as Yao-Yao) is a spanner with stretch factor 11.67. The stretch factor drops down to 4.75 for k > 7.
A PSPACE-Complete First Order Fragment of Computability Logic
Matthew S. Bauer
In a recently launched research program for developing logic as a formal theory of (interactive) computability, several very interesting logics have been introduced and axiomatized…
On the Weak Computability of Continuous Real Functions
Matthew S. Bauer, Xizhong Zheng
In computable analysis, sequences of rational numbers which effectively converge to a real number x are used as the (rho-) names of x. A real number x is computable if it has a com…