A recursion-theoretic characterisation of the positive polynomial-time functions (Q5079742): Difference between revisions

@@ label / en / label / en @@
+A recursion-theoretic characterisation of the positive polynomial-time functions
@@ Property / DOI @@
-.4230/LIPIcs.CSL.2018.18
@@ Property / DOI: 10.4230/LIPIcs.CSL.2018.18 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+The monotone circuit complexity of Boolean functions
+Normal rank
@@ Property / cites work @@
+On uniformity within \(NC^ 1\)
@@ Property / cites work: On uniformity within \(NC^ 1\) / rank @@
+Normal rank
@@ Property / cites work @@
+A new recursion-theoretic characterization of the polytime functions
+Normal rank
@@ Property / cites work @@
+Q3794177
@@ Property / cites work: Q3794177 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4718423
@@ Property / cites work: Q4718423 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5586401
@@ Property / cites work: Q5586401 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5306365
@@ Property / cites work: Q5306365 / rank @@
+Normal rank
@@ Property / cites work @@
+From positive and intuitionistic bounded arithmetic to monotone proof complexity
+Normal rank
@@ Property / cites work @@
+Q3487327
@@ Property / cites work: Q3487327 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2754203
@@ Property / cites work: Q2754203 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4036700
@@ Property / cites work: Q4036700 / rank @@
+Normal rank
@@ Property / cites work @@
+Monotone Boolean functions
@@ Property / cites work: Monotone Boolean functions / rank @@
+Normal rank
@@ Property / cites work @@
+Positive versions of polynomial time
@@ Property / cites work: Positive versions of polynomial time / rank @@
+Normal rank
@@ Property / cites work @@
+A foundational delineation of poly-time
@@ Property / cites work: A foundational delineation of poly-time / rank @@
+Normal rank
@@ Property / cites work @@
+Q4339320
@@ Property / cites work: Q4339320 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3758729
@@ Property / cites work: Q3758729 / rank @@
+Normal rank
@@ Property / cites work @@
+Classes of Predictably Computable Functions
@@ Property / cites work: Classes of Predictably Computable Functions / rank @@
+Normal rank
@@ Property / cites work @@
+On uniform circuit complexity
@@ Property / cites work: On uniform circuit complexity / rank @@
+Normal rank
@@ Property / cites work @@
+The gap between monotone and non-monotone circuit complexity is exponential
+Normal rank
@@ Property / cites work @@
+Complete sets and the polynomial-time hierarchy
@@ Property / cites work: Complete sets and the polynomial-time hierarchy / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.4230/lipics.csl.2018.18
+Normal rank
@@ Property / OpenAlex ID @@
+W2889165966
@@ Property / OpenAlex ID: W2889165966 / rank @@
+Normal rank
@@ Property / title @@
+A recursion-theoretic characterisation of the positive polynomial-time functions (English)
+Normal rank
@@ Property / DOI @@
+.4230/LIPICS.CSL.2018.18
@@ Property / DOI: 10.4230/LIPICS.CSL.2018.18 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5079742