On the average case complexity of some P-complete problems
Serna, Maria ; Xhafa, Fatos
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 33 (1999), p. 33-45 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU)
Publié le : 1999-01-01
@article{ITA_1999__33_1_33_0,
     author = {Serna, Maria and Xhafa, Fatos},
     title = {On the average case complexity of some P-complete problems},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {33},
     year = {1999},
     pages = {33-45},
     mrnumber = {1705854},
     zbl = {0927.68038},
     language = {en},
     url = {http://dml.mathdoc.fr/item/ITA_1999__33_1_33_0}
}

Serna, Maria; Xhafa, Fatos. On the average case complexity of some P-complete problems. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 33 (1999) pp. 33-45. http://gdmltest.u-ga.fr/item/ITA_1999__33_1_33_0/

[1] J. L. Balcázar, J. Díaz and J. Gabarró, Structural complexity II, Springer Verlag (1995). | MR 1324338

[2] N. Calkin and A. Frieze, Probabilistic analysis of a parallel algorithm for finding a maximal independent set. Random Structures and Algorithrns 1 (1990) 39-50. | MR 1068490 | Zbl 0707.68042

[3] S. A. Cook, An Observation on time-storage trade-offs. J. Comp. Syst. Sci. 9 (1974) 308-316. | MR 398160 | Zbl 0306.68026

[4] D. Coppersmith, P. Raghavan and M. Tompa, Parallel graph algorithms that are efficient in average, in Proc. of 28th IEEE Symposium on Foundations of Computer Science (1987) 260-269.

[5] J. Díaz, M. Serna, P. Spirakis and J. Torán, On the expected depth of Boolean circuits. Technical Report LSI-94-7-R, Universitat Politècnica de Catalunya, Dept. de LSI (1994).

[6] R. Greenlaw, H. J. Hoover and W. L. Ruzzo, Limits to parallel computation: P-completeness theory. Oxford University Press (1995). | MR 1333600 | Zbl 0829.68068

[7] J. Hoover and W. Ruzzo, A compendium of problems complete for P. Manuscript (1984).

[8] N. D. Jones and T. Laaser, Complete problems for deterministic polynomial time. Theoret. Comput. Sci. 3 (1977) 105-117. | MR 455543 | Zbl 0352.68068

[9] D. E. Knuth, The art of computer programming, Vol. 1. Addison-Wesley (1973). | MR 378456

[10] D. Kozen, Complexity of finitely presented algebras; in Proc. of 9th ACM STOC (1977) 164-167. | MR 488999

[11] R. E. Ladner, The circuit value problem is logspace complete for P. SIGACT News 7 (1975) 18-20.

[12] M. Serna, The parallel approximbility of P-complete problems. PhD thesis, Universitat Politècnica de Catalunya (1990).

[13] M. Serna, Approximating linear programming is logspace complete for P. Inform. Proc. Lett 37 (1991) 233-236. | MR 1095711 | Zbl 0713.90046

[14] S. Sahni and T. Gonzalez, P-complete approximation problems. J. Assoc. Comput. Mach. 23 (1976) 555-565. | MR 408313 | Zbl 0348.90152

[15] M. Serna and P. G. Spirakis, The approximability of problems complete for P, in International Symposium on Optimal Algorithms, Springer-Verlag, Lecture Notes in Computer Science 401 (1989) 193-204. | MR 1048163 | Zbl 0704.68041

[16] T. Tsukiji and F. Xhafa, On the expected depth of randomly generated circuits, J. Díaz and M. Serna Eds., in Proc. of Fourth European Symposium on Algorithms, ESA'96, Springer-Verlag, Lecture Notes in Computer Science 1136 (1996) 208-220. | MR 1469233