Polynomial time computations in models of ETJOSEPH, D.Journal of computer and system sciences (Print). 1983, Vol 26, Num 3, pp 311-338, issn 0022-0000Article

The complexity of monadic recursion schemes: exponential time boundsHUNT, H. B. III; ROSENKRANTZ, D. J.Journal of computer and system sciences (Print). 1984, Vol 28, Num 3, pp 395-419, issn 0022-0000Article

Relativizations comparing NP and exponential timeGASARCH, W. I; HOMER, S.Information and control. 1983, Vol 58, Num 1-3, pp 88-100, issn 0019-9958Article

A generalized class of polynomials that are hard to factorKALTOFEN, E; MUSSER, D. R; SAUNDERS, B. D et al.SIAM journal on computing (Print). 1983, Vol 12, Num 3, pp 473-483, issn 0097-5397Article

On a relativized polynomial and exponential computationsHELLER, H.SIAM journal on computing (Print). 1984, Vol 13, Num 4, pp 717-725, issn 0097-5397Article

Exact Exponential AlgorithmsFOMIN, Fedor V; KASKI, Petteri.Communications of the ACM. 2013, Vol 56, Num 3, pp 80-88, issn 0001-0782, 9 p.Article

Symbolic model checking for μ-calculus requires exponential timeRABINOVICH, A.Theoretical computer science. 2000, Vol 243, Num 1-2, pp 467-475, issn 0304-3975Article

Holographic algorithmsVALIANT, Leslie G.Annual Symposium on Foundations of Computer Science. 2004, pp 306-315, isbn 0-7695-2228-9, 1Vol, 10 p.Conference Paper

COMPLETENESS, APPROXIMATION AND DENSITYKER I KO; MOORE D.1981; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1981; VOL. 10; NO 4; PP. 787-796; BIBL. 16 REF.Article

ON RESOLUTION WITH CLAUSES OF BOUNDED SIZE.GALIL Z.1977; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1977; VOL. 6; NO 3; PP. 444-459; BIBL. 8 REF.Article

THE INTRINSICALLY EXPONENTIAL COMPLEXITY OF THE CIRCULARITY PROBLEM FOR ATTRIBUTE GRAMMARS.JAZAHERI M; OGDEN WF; ROUNDS WC et al.1975; COMMUNIC. A.C.M.; U.S.A.; DA. 1975; VOL. 18; NO 12; PP. 697-706; BIBL. 18 REF.; (2ND. ACM SYMP. PRINC. PROGRAM. LANG.; PALO ALTO, CALIF.; 1975)Conference Paper

Complete problems and strong polynomial reducibilitiesGANESAN, K; HOMER, S.SIAM journal on computing (Print). 1992, Vol 21, Num 4, pp 733-742, issn 0097-5397Article

Complexity of E0L structural equivalenceSALOMAA, K; WOOD, D; SHENG YU et al.Informatique théorique et applications (Imprimé). 1995, Vol 29, Num 6, pp 471-485, issn 0988-3754Article

Complexity results for the gap inequalities for the max-cut problemGALLI, Laura; KAPARIS, Konstantinos; LETCHFORD, Adam N et al.Operations research letters. 2012, Vol 40, Num 3, pp 149-152, issn 0167-6377, 4 p.Article

AN ISOMORPHISM BETWEEN SUBEXPONENTIAL AND PARAMETERIZED COMPLEXITY THEORYYIJIA CHEN; GROHE, Martin.SIAM journal on computing (Print). 2008, Vol 37, Num 4, pp 1228-1258, issn 0097-5397, 31 p.Article

On the tree-transformation power of XSLTJANSSEN, Wim; KORLYUKOV, Alexandr; VAN DEN BUSSCHE, Jan et al.Acta informatica. 2007, Vol 43, Num 6, pp 371-393, issn 0001-5903, 23 p.Article

One-way functions and the isomorphism conjectureGANESAN, K.Theoretical computer science. 1994, Vol 129, Num 2, pp 309-321, issn 0304-3975Article

Sur les lois des fonctionnelles exponentielles du mouvement brownin, considérées en certains instants aléatories = The laws of exponential functionals of Brownian motion, taken at various random timesYOR, M.Comptes rendus de l'Académie des sciences. Série 1, Mathématique. 1992, Vol 314, Num 12, pp 951-956, issn 0764-4442Article

The time complexity of typechecking tree-walking tree transducersENGELFRIET, Joost.Acta informatica. 2009, Vol 46, Num 2, pp 139-154, issn 0001-5903, 16 p.Article

Mining Frequent Item Sets Efficiently by Using Compression TechniquesMIMAROGLU, Selim; CUBUKCU, Cagri; AKSEHIRLI, Emin et al.Data mining. International conferenceWorldComp'2011. 2011, pp 308-312, isbn 1-60132-168-6, 5 p.Conference Paper

Arcsine laws and interval partitions derived from a stable subordinatorPITMAN, J; YOR, M.Proceedings of the London Mathematical Society. 1992, Vol 65, pp 326-356, issn 0024-6115, 2Article

The worst-case running time of the random simplex algorithm is exponential in the heightBRODER, A. Z; DYER, M. E; FRIEZE, A. M et al.Information processing letters. 1995, Vol 56, Num 2, pp 79-81, issn 0020-0190Article

A RECURSIVE AND A GRAMMATICAL CHARACTERIZATION OF THE EXPONENTIAL-TIME LANGUAGES.MONIEN B.1976; THEOR. COMPUTER SCI.; NETH.; DA. 1976 PARU 1977; VOL. 3; NO 1; PP. 61-74; BIBL. 12 REF.Article

Understanding the Empirical Hardness of NP-Complete ProblemsLEYTON-BROWN, Kevin; HOOS, Holger H; HUTTER, Frank et al.Communications of the ACM. 2014, Vol 57, Num 5, pp 98-107, issn 0001-0782, 10 p.Article

On the Exact Complexity of Evaluating Quantified k-CNFCALABRO, Chris; IMPAGLIAZZO, Russell; PATURI, Ramamohan et al.Algorithmica. 2013, Vol 65, Num 4, pp 817-827, issn 0178-4617, 11 p.Article