Feasible set functions have small circuits

Number of the records: 1

1.

SYSNO	0499289
Title	Feasible set functions have small circuits
Author(s)	Beckmann, A. (GB) Buss, S. (US) Friedman, S.-D. (AT) Müller, M. (AT) Thapen, Neil (MU-W)_{RID, SAI}
Corespondence/senior	Beckmann, A. - Korespondující autor
Source Title	Computability. Roč. 8, č. 1 (2019), s. 67-98. - : IOS Press
Document Type	Článek v odborném periodiku
Grant	339691, XE - EU countries
Institutional support	MU-W - RVO:67985840
Language	eng
Country	NL
Keywords	computational complexity * primitive recursive set functions * circuit complexity * Cobham recursive set functions
Cooperating institutions	Swansea University (United Kingdom) University of California, San Diego (United States) University of Vienna (Austria)
URL	http://dx.doi.org/10.3233/COM-180096
Permanent Link	http://hdl.handle.net/11104/0291518

	File	Download	Size	Commentary	Version	Access
	Thapen1.pdf	1	310.7 KB		Publisher’s postprint	require

Number of the records: 1