Acceptor-Definable Counting Classes

Kiayias, A; Pagourtzis, A; Sharma, K; Zachos, S

dc.contributor.author	Kiayias, A	en
dc.contributor.author	Pagourtzis, A	en
dc.contributor.author	Sharma, K	en
dc.contributor.author	Zachos, S	en
dc.date.accessioned	2014-03-01T02:49:02Z
dc.date.available	2014-03-01T02:49:02Z
dc.date.issued	2001	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/34241
dc.subject	Complexity Class	en
dc.subject	Counting Function	en
dc.subject	Optimization Problem	en
dc.subject	Perfect Match	en
dc.subject	Polynomial Time	en
dc.subject	turing machine	en
dc.title	Acceptor-Definable Counting Classes	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/3-540-38076-0_29	en
heal.identifier.secondary	http://dx.doi.org/10.1007/3-540-38076-0_29	en
heal.publicationDate	2001	en
heal.abstract	Counting functions that can be defined on non-deterministic acceptors (Turing machines without output), as opposed to those defined by transducers (Turing machines with output), have attracted much interest since 1979, when Valiant introduced the important class #P [19]. Apart from #P, several such classes have been defined in the literature [2], [5], [3], [12], [6]. Here we study the path-order	en
heal.journalName	Panhellenic Conference on Informatics	en
dc.identifier.doi	10.1007/3-540-38076-0_29	en