Knapsack and subset sum problems in nilpoint, polycyclic, and co-context-free groups

In Delaram Kahrobaei, Bren Cavallo & David Garber (eds.), Algebra and computer science. Providence, Rhode Island: American Mathematical Society (2016)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,475

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Logical aspects of Cayley-graphs: the group case.Dietrich Kuske & Markus Lohrey - 2004 - Annals of Pure and Applied Logic 131 (1-3):263-286.
Big Data Flow Adjustment using Knapsack Problem.A. A. Salama, M. Elsayed Wahed & Eyman Yosef - 2018 - Journal of Computer and Communications 6 (10):30-39.
On the free subset property at singular cardinals.Peter Koepke - 1989 - Archive for Mathematical Logic 28 (1):43-55.
Borel reductions of profinite actions of SL n.Samuel Coskey - 2010 - Annals of Pure and Applied Logic 161 (10):1270-1279.
Rationality and Free Will.Jerry Kapus - 2018 - Proceedings of the XXIII World Congress of Philosophy 23:47-52.
An isolic generalization of Cauchy's theorem for finite groups.J. C. E. Dekker - 1990 - Archive for Mathematical Logic 29 (4):231-236.
Free will and luck: Précis.Alfred R. Mele - 2007 - Philosophical Explorations 10 (2):153-155.

Analytics

Added to PP
2022-12-13

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references