Comments on Arithmetic Complexity, Kleene Closure, and Formal Power Series

Journal article

Open access

Peer reviewed

Eric Allender, V Arvind and Meena Mahajan

Theory of computing systems, Vol.53(3), pp.503-506

10/2013

Abstract

Computational Mathematics and Numerical Analysis

Theory of Computation

Computer Science

url

https://doi.org/10.1007/s00224-013-9471-2View

Version of Record (VoR) Open

8 Record Views

Title: Comments on Arithmetic Complexity, Kleene Closure, and Formal Power Series
Creators: Eric Allender - Department of Computer Science Rutgers University Piscataway NJ 08854 USA
V Arvind - The Institute of Mathematical Sciences C.I.T. Campus Chennai 600113 India
Meena Mahajan - The Institute of Mathematical Sciences C.I.T. Campus Chennai 600113 India
Publication Details: Theory of computing systems, Vol.53(3), pp.503-506
Date published: 10/2013
Publisher: Springer US
Academic Unit: Computer Science (SAS)
Language: English
Resource Type: Journal article
Identifiers: 991031654686304646