No label defined (Q5089032)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7559295

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 7559295

Statements

scholarly article

0 references

0 references

publication date

18 July 2022

0 references

zbMATH Keywords

implicit complexity

0 references

recursion theory

0 references

MaRDI profile type

MaRDI publication profile

0 references

Arithmetizing uniform \(NC\)

0 references

A new recursion-theoretic characterization of the polytime functions

0 references

Function-algebraic characterizations of log and polylog parallel time

0 references

Two function algebras defining functions in \(\mathsf{NC}^k\) Boolean circuits

0 references

0 references

0 references

Linear types and non-size-increasing polynomial time computation.

0 references

Pure pointer programs with iteration

0 references

Recursion schemata for slowly growing depth circuit classes

0 references

A characterization of alternating log time by ramified recurrence

0 references

Programming Languages and Systems

0 references

On uniform circuit complexity

0 references

Identifiers

10.4230/LIPIcs.FSCD.2019.29

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5089032

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5089032&oldid=36831174"