Neolithic 发表于 2025-3-30 08:54:40

http://reply.papertrans.cn/27/2683/268289/268289_51.png

Felicitous 发表于 2025-3-30 15:01:07

http://reply.papertrans.cn/27/2683/268289/268289_52.png

Spartan 发表于 2025-3-30 20:17:29

http://reply.papertrans.cn/27/2683/268289/268289_53.png

鞠躬 发表于 2025-3-30 21:54:57

https://doi.org/10.1007/978-94-007-6049-3We survey several recent developments in quantum algorithms and complexity:

相一致 发表于 2025-3-31 02:09:19

https://doi.org/10.1007/978-94-007-6049-3A celebrated result of Schützenberger says that a language is star-free if and only if it is is recognized by a finite aperiodic monoid. We give a new proof for this theorem using local divisors.

vitrectomy 发表于 2025-3-31 08:47:27

http://reply.papertrans.cn/27/2683/268289/268289_56.png

陈腐的人 发表于 2025-3-31 10:10:57

https://doi.org/10.1007/978-94-007-6049-3In the paper we investigate a model for computing of Boolean functions – Ordered Binary Decision Diagrams (OBDDs), which is a restricted version of Branching Programs. We present several results on the comparative complexity for several variants of OBDD models.

大方一点 发表于 2025-3-31 13:37:36

http://reply.papertrans.cn/27/2683/268289/268289_58.png

Blemish 发表于 2025-3-31 20:39:59

http://reply.papertrans.cn/27/2683/268289/268289_59.png

外星人 发表于 2025-3-31 23:05:10

http://reply.papertrans.cn/27/2683/268289/268289_60.png
页: 1 2 3 4 5 [6] 7
查看完整版本: Titlebook: Descriptional Complexity of Formal Systems; 16th International W Helmut Jürgensen,Juhani Karhumäki,Alexander Okhoti Conference proceedings