𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Languages Defined with Modular Counting Quantifiers

✍ Scribed by Howard Straubing

Book ID
112252539
Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
138 KB
Volume
166
Category
Article
ISSN
0890-5401

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The counting complexity of group-definab
The counting complexity of group-definable languages
✍ V. Arvind; N.V. Vinodchandran πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 166 KB

A group family is a countable family B = {Bn}nΒΏ0 of ΓΏnite black-box groups, i.e., the elements of each group Bn are uniquely encoded as strings of uniform length (polynomial in n) and for each Bn the group operations are computable in time polynomial in n. In this paper we study the complexity of NP

Counting curves with modular forms
Counting curves with modular forms
✍ MΓ₯ns Henningson; Gregory Moore πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 421 KB