Generic Complexity of Undecidable Problems

2007 ◽  
pp. 407-417
Author(s):  
Alexei Myasnikov
Keyword(s):  
Generic Complexity

On generic complexity of the subset sum problem in monoids and groups of integer matrix of order two

2020 ◽  
Vol 25 (4) ◽  
pp. 10-15
Author(s):  
Alexander Nikolaevich Rybalov
Keyword(s):  
Linear Group ◽  
Modular Group ◽  
Special Linear Group ◽  
Second Order ◽  
Integer Matrix ◽  
Subset Sum ◽  
Algorithmic Problems ◽  
Almost All ◽  
Subset Sum Problems ◽  
Generic Complexity

Generic-case approach to algorithmic problems was suggested by A. Miasnikov, I. Kapovich, P. Schupp and V. Shpilrain in 2003. This approach studies behavior of an algo-rithm on typical (almost all) inputs and ignores the rest of inputs. In this paper, we prove that the subset sum problems for the monoid of integer positive unimodular matrices of the second order, the special linear group of the second order, and the modular group are generically solvable in polynomial time.

Life disruption and generic complexity: a social linguistic analysis of narratives of cancer illness

2001 ◽  
Vol 53 (9) ◽  
pp. 1227-1236 ◽  
Author(s):  
Christopher F.C Jordens ◽  
Miles Little ◽  
Kim Paul ◽  
Emma-Jane Sayers
Keyword(s):  
Linguistic Analysis ◽  
Generic Complexity ◽  
Analysis Of Narratives

The Genres of the Pentateuch and Their Social Settings

2021 ◽  
pp. 361-378
Author(s):  
Angela Roskop Erisman
Keyword(s):  
Literary History ◽  
Social Contexts ◽  
Genre Theory ◽  
Critical Study ◽  
Literary Genres ◽  
Social Settings ◽  
History Of ◽  
Classic Form ◽  
Stable Forms ◽  
Generic Complexity

The ability to recognize genres has been central to modern critical study of the Pentateuch since the work of Hermann Gunkel at the turn of the twentieth century. This essay surveys the legal, administrative, and literary genres used in the Pentateuch, offering a sense of its generic complexity. Genres are defined not as the fixed and stable forms used to classify texts, as understood by classic form-critical method, but as idealized cognitive models employed as tools for writing and interpreting texts, an understanding drawn from modern genre theory. Because genres are situated in social contexts, Gunkel saw genre as central to writing a history of Israel’s literature. This essay surveys the limitations of Gunkel’s vision yet identifies a way to reconnect with it and write a more organic literary history, one that may intersect with but also at times challenge the results of source- and redaction-critical methods.

On the generic complexity of the searching graph isomorphism problem

2015 ◽  
Vol 7 (2) ◽  
Author(s):  
Alexander Rybalov
Keyword(s):  
Graph Isomorphism ◽  
Isomorphism Problem ◽  
Worst Case ◽  
Graph Isomorphism Problem ◽  
Algorithmic Problems ◽  
Generic Complexity

AbstractA generic-case approach to algorithmic problems was suggested by Myasnikov, Kapovich, Schupp and Shpilrain in 2003. This approach studies the behavior of an algorithm on typical inputs and ignores the rest of the inputs. In this paper we consider generic complexity of the searching graph isomorphism problem. We fit this problem in the frameworks of generic complexity and prove that its natural subproblem is generically hard provided that the searching graph isomorphism problem is hard in the worst case.

scholarly journals Generic complexity of solving of equations in finite groups, semigroups and fields

2021 ◽  
Vol 1901 (1) ◽  
pp. 012047
Author(s):  
Alexander Rybalov ◽  
Artem Shevlyakov
Keyword(s):  
Finite Groups ◽  
Generic Complexity

Generic Complexity in Ibsen's An Enemy of the People

1986 ◽  
Vol 20 (2) ◽  
pp. 95-114 ◽  
Author(s):  
Thomas F. Van Laan
Keyword(s):  
The People ◽  
Generic Complexity
Sign in / Sign up

Export Citation Format

Share Document