Time-Space Tradeoffs for Counting NP Solutions Modulo Integers

ISSN： 1016-3328

Source： computational complexity, Vol.17, Iss.2, 2008-05, pp. : 179-219

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Time-Space Tradeoffs for Undirected Graph Traversal by Graph Automata

By Beame P. Borodin A. Raghavan P. Ruzzo W.L. Tompa M.

Information and Computation, Vol. 130, Iss. 2, 1996-11 ,pp. : 101-129

Academic Press

Access to resources Recommend Favorite

Counting RSA-Integers

By Decker Andreas

Results in Mathematics, Vol. 52, Iss. 1-2, 2008-08 ,pp. : 35-39

Springer Publishing Company

Access to resources Recommend Favorite

Counting sumsets and sum-free sets modulo a prime

By Green Ben Ruzsa Imre

Studia Scientiarum Mathematicarum Hungarica, Vol. 41, Iss. 3, 2004-08 ,pp. : 285-293

Akademiai Kiado

Access to resources Recommend Favorite

Determinants of Matrices over the Integers Modulo m

By Lockhart Jody M. Wardlaw William P.

Mathematics Magazine, Vol. 80, Iss. 3, 2007-06 ,pp. : 207-214

Mathematical Association of America

Access to resources Recommend Favorite

Computing Jacobi Symbols modulo Sparse Integers and Polynomials and Some Applications

By Shparlinski I.E.

Journal of Algorithms, Vol. 36, Iss. 2, 2000-08 ,pp. : 241-252

Academic Press

Access to resources Recommend Favorite