Security without identification: transaction systems to make big brother absoleteCHAUM, D.Communications of the ACM. 1983, Vol 28, Num 10, pp 1030-1044, issn 0001-0782Article

Complete divisibility problems for slowly utilized oraclesPLAISTED, D. A.Theoretical computer science. 1985, Vol 35, Num 2-3, pp 245-260, issn 0304-3975Article

Pseudorandom number generation and space complexityFURST, M; LIPTON, R; STOCKMEYER, L et al.Information and control. 1985, Vol 64, Num 1-3, pp 43-51, issn 0019-9958Article

Gradually intractable problems and nondeterministic log-space lower boundsKASAI, T; IWATA, S.Mathematical systems theory. 1985, Vol 18, Num 2, pp 153-170, issn 0025-5661Article

Cramer-DamgÅrd signatures revisited : Efficient flat-tree signatures based on factoringCATALANO, Dario; GENNARO, Rosario.Theoretical computer science. 2007, Vol 370, Num 1-3, pp 186-200, issn 0304-3975, 15 p.Article

The intractability of resolutionHAKEN, A.Theoretical computer science. 1985, Vol 39, Num 2-3, pp 297-308, issn 0304-3975Article

Oblivious polynomial evaluationNAOR, Moni; PINKAB, Benny.SIAM journal on computing (Print). 2006, Vol 35, Num 5, pp 1254-1281, issn 0097-5397, 28 p.Article

Minimal-change integrity maintenance using tuple deletionsCHOMICKI, Jan; MARCINKOWSKI, Jerzy.Information and computation (Print). 2005, Vol 197, Num 1-2, pp 90-121, issn 0890-5401, 32 p.Article

Well-covered circulant graphsBROWN, Jason; HOSHINO, Richard.Discrete mathematics. 2011, Vol 311, Num 4, pp 244-251, issn 0012-365X, 8 p.Article

UNIVERSAL ARGUMENTS AND THEIR APPLICATIONSBARAK, Boaz; COLDREICH, Oded.SIAM journal on computing (Print). 2009, Vol 38, Num 5, pp 1661-1694, issn 0097-5397, 34 p.Article

The complexity of maximum matroid-greedoid intersection and weighted greedoid maximizationMIELIKÄINEN, Taneli; UKKONEN, Esko.Discrete applied mathematics. 2006, Vol 154, Num 4, pp 684-691, issn 0166-218X, 8 p.Conference Paper

PARAMETERIZED COMPLEXITY OF ARC-WEIGHTED DIRECTED STEINER PROBLEMSJIONG GUO; NIEDERMEIER, Rolf; SUCHY, Ondrej et al.SIAM journal on discrete mathematics (Print). 2011, Vol 25, Num 1-2, pp 583-599, issn 0895-4801, 17 p.Article

Building species trees from larger parts of phylogenomic databasesSCORNAVACCA, C; BERRY, V; RANWEZ, V et al.Information and computation (Print). 2011, Vol 209, Num 3, pp 590-605, issn 0890-5401, 16 p.Conference Paper

INTERVAL COMPLETION IS FIXED PARAMETER TRACTABLEVILLANGER, Yngve; HEGGERNES, Pinar; PAUL, Christophe et al.SIAM journal on computing (Print). 2009, Vol 38, Num 5, pp 2007-2020, issn 0097-5397, 14 p.Article

Oblivious polynomial evaluation and oblivious neural learningCHANG, Yan-Cheng; LU, Chi-Jen.Theoretical computer science. 2005, Vol 341, Num 1-3, pp 39-54, issn 0304-3975, 16 p.Article

Intractability of approximate multi-dimensional nonlinear optimization on independence systemsLEE, Jon; ONN, Shmuel; WEISMANTEL, Robert et al.Discrete mathematics. 2011, Vol 311, Num 8-9, pp 780-783, issn 0012-365X, 4 p.Article

Intractability results in predicate detectionKASHYAP, Sujatha; GARG, Vijay K.Information processing letters. 2005, Vol 94, Num 6, pp 277-282, issn 0020-0190, 6 p.Article

The intractability of computing the Hamming distanceMANTHEY, Bodo; REISCHUK, Rüdiger.Theoretical computer science. 2005, Vol 337, Num 1-3, pp 331-346, issn 0304-3975, 16 p.Article

A computational proof of complexity of some restricted counting problemsCAI, Jin-Yi; PINYAN LU; MINGJI XIA et al.Theoretical computer science. 2011, Vol 412, Num 23, pp 2468-2485, issn 0304-3975, 18 p.Article

Existentially restricted quantified constraint satisfactionHUBIE CHEN.Information and computation (Print). 2009, Vol 207, Num 3, pp 369-388, issn 0890-5401, 20 p.Article

Inapproximability of the Tutte polynomialGOLDBERG, Leslie Ann; JERRUM, Mark.Information and computation (Print). 2008, Vol 206, Num 7, pp 908-929, issn 0890-5401, 22 p.Article

THE COMPLEXITY OF QUANTIFIED CONSTRAINT SATISFACTION : COLLAPSIBILITY, SINK ALGEBRAS, AND THE THREE-ELEMENT CASEHUBIE CHEN.SIAM journal on computing (Print). 2008, Vol 37, Num 5, pp 1674-1701, issn 0097-5397, 28 p.Article

On polynomial time one-truth-table reducibility to a sparse setWATANABE, O.Journal of computer and system sciences (Print). 1992, Vol 44, Num 3, pp 500-516, issn 0022-0000Article

Intractability of min- and max-cut in streaming graphsZELKE, Mariano.Information processing letters. 2011, Vol 111, Num 3, pp 145-150, issn 0020-0190, 6 p.Article

INTRACTABILITY OF CLIQUE-WIDTH PARAMETERIZATIONSFOMIN, Fedor V; GOLOVACH, Petr A; LOKSHTANOV, Daniel et al.SIAM journal on computing (Print). 2010, Vol 39, Num 5, pp 1941-1956, issn 0097-5397, 16 p.Article