Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
The computational strength of matchings in countable graphs - MaRDI portal

The computational strength of matchings in countable graphs

From MaRDI portal

Publication:6343310

Jump to:navigation, search

DOI10.1016/J.APAL.2022.103133arXiv2006.11334WikidataQ114202053 ScholiaQ114202053MaRDI QIDQ6343310

Stephen Flood, Matthew Jura, Oscar Levin, Tyler Markkanen

Publication date: 19 June 2020

Mathematics Subject Classification ID

Applications of computability and recursion theory (03D80) Second- and higher-order arithmetic and fragments (03F35) Computability and recursion theory (03D99) Recursive ordinals and ordinal notations (03F15)

This page was built for publication: The computational strength of matchings in countable graphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6343310&oldid=35953469"