Results for 'Complexity of word problems'

1000+ found
Order:
  1.  34
    Generic Complexity of Undecidable Problems.Alexei G. Myasnikov & Alexander N. Rybalov - 2008 - Journal of Symbolic Logic 73 (2):656 - 673.
    In this paper we study generic complexity of undecidable problems. It turns out that some classical undecidable problems are, in fact, strongly undecidable, i.e., they are undecidable on every strongly generic subset of inputs. For instance, the classical Halting Problem is strongly undecidable. Moreover, we prove and analog of the Rice theorem for strongly undecidable problems, which provides plenty of examples of strongly undecidable problems. Then we show that there are natural super-undecidable problems. i.e., (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  2.  20
    Seperating the intrinsic complexity and the derivational complexity of the word problem for finitely presented groups.Daniel E. Cohen, Klaus Madlener & Friedrich Otto - 1993 - Mathematical Logic Quarterly 39 (1):143-157.
    A pseudo-natural algorithm for the word problem of a finitely presented group is an algorithm which not only tells us whether or not a word w equals 1 in the group but also gives a derivation of 1 from w when w equals 1. In [13], [14] Madlener and Otto show that, if we measure complexity of a primitive recursive algorithm by its level in the Grzegorczyk hierarchy, there are groups in which a pseudo-natural algorithm is arbitrarily (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  3.  5
    A Study of Word Complexity Under Conditions of Non-experimental, Natural Overt Speech Production Using ECoG.Olga Glanz, Marina Hader, Andreas Schulze-Bonhage, Peter Auer & Tonio Ball - 2022 - Frontiers in Human Neuroscience 15:711886.
    The linguistic complexity of words has largely been studied on the behavioral level and in experimental settings. Only little is known about the neural processes underlying it in uninstructed, spontaneous conversations. We built up a multimodal neurolinguistic corpus composed of synchronized audio, video, and electrocorticographic (ECoG) recordings from the fronto-temporo-parietal cortex to address this phenomenon based on uninstructed, spontaneous speech production. We performed extensive linguistic annotations of the language material and calculated word complexity using several numeric parameters. (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  4.  20
    Text Integration and Mathematical Connections: A Computer Model of Arithmetic Word Problem Solving.Mark D. LeBlanc & Sylvia Weber-Russell - 1996 - Cognitive Science 20 (3):357-407.
    Understanding arithmetic word problems involves a complex interaction of text comprehension and mathematical processes. This article presents a computer simulation designed to capture the working memory demands required in “bottomup” comprehension of arithmetic word problems. The simulation's sentence‐level parser and text integration component reflect the importance of processing the problem from its original natural language presentation. Children's probability of solution was analyzed in exploratory regression analyses as a function of the simulation's sentence‐level and text integration processes. (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  5.  29
    The complexity of first-order and monadic second-order logic revisited.Markus Frick & Martin Grohe - 2004 - Annals of Pure and Applied Logic 130 (1-3):3-31.
    The model-checking problem for a logic L on a class C of structures asks whether a given L-sentence holds in a given structure in C. In this paper, we give super-exponential lower bounds for fixed-parameter tractable model-checking problems for first-order and monadic second-order logic. We show that unless PTIME=NP, the model-checking problem for monadic second-order logic on finite words is not solvable in time f·p, for any elementary function f and any polynomial p. Here k denotes the size of (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  6.  12
    Complexity of the Infinitary Lambek Calculus with Kleene Star.Stepan Kuznetsov - 2021 - Review of Symbolic Logic 14 (4):946-972.
    We consider the Lambek calculus, or noncommutative multiplicative intuitionistic linear logic, extended with iteration, or Kleene star, axiomatised by means of an$\omega $-rule, and prove that the derivability problem in this calculus is$\Pi _1^0$-hard. This solves a problem left open by Buszkowski (2007), who obtained the same complexity bound for infinitary action logic, which additionally includes additive conjunction and disjunction. As a by-product, we prove that any context-free language without the empty word can be generated by a Lambek (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  7. Language and the complexity of the world.Paul Teller - manuscript
    Nature is complex, exceedingly so. A repercussion of this “complex world constraint” is that it is, in practice, impossible to connect words to the world in a foolproof manner. In this paper I explore the ways in which the complex world constraint makes vagueness, or more generally imprecision, in language in practice unavoidable, illuminates what vagueness comes to, and guides us to a sensible way of thinking about truth. Along the way we see that the problem of ceteris paribus laws (...)
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  8. Language and the complexity of the world.Paul Teller - manuscript
    Nature is complex, exceedingly so. A repercussion of this “complex world constraint” is that it is, in practice, impossible to connect words to the world in a foolproof manner. In this paper I explore the ways in which the complex world constraint makes vagueness, or more generally imprecision, in language in practice unavoidable, illuminates what vagueness comes to, and guides us to a sensible way of thinking about truth. Along the way we see that the problem of ceteris paribus laws (...)
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  9.  46
    On the parameterized complexity of short computation and factorization.Liming Cai, Jianer Chen, Rodney G. Downey & Michael R. Fellows - 1997 - Archive for Mathematical Logic 36 (4-5):321-337.
    A completeness theory for parameterized computational complexity has been studied in a series of recent papers, and has been shown to have many applications in diverse problem domains including familiar graph-theoretic problems, VLSI layout, games, computational biology, cryptography, and computational learning [ADF,BDHW,BFH, DEF,DF1-7,FHW,FK]. We here study the parameterized complexity of two kinds of problems: (1) problems concerning parameterized computations of Turing machines, such as determining whether a nondeterministic machine can reach an accept state in \documentclass[12pt]{minimal} (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  10.  44
    The Multidimensionality of Environmental Problems: The GMO Controversy and the Limits of Scientific Materialism.Michael S. Carolan - 2008 - Environmental Values 17 (1):67 - 82.
    This paper argues for a broader understanding of complexity; an understanding that speaks to the multidimensionality of environmental problems. As argued, environmental problems rest upon ontological, epistemological, and moral claims; they rest, in other words, upon statements about what is, knowledge, and what ought to be, respectively. To develop and illustrate this argument, the GMO (genetically modified organism) controversy is broken down according to these three dimensions. Dissecting environmental problems in this manner reveals why we cannot (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  11.  15
    The Transcendence of Words.Akos Krassoy - 2016 - Levinas Studies 10 (1):1-42.
    In lieu of an abstract, here is a brief excerpt of the content:The Transcendence of WordsAkos Krassoy (bio)Levinas’s central contribution to aesthetics and the philosophy of art is his well-known and provocative attempt to ethicize art. Yet, there is hardly any certainty regarding the nature of this ethicization. As far as the realization of Levinas’s program is concerned, readers usually remember its harmful effects.1 On the other hand, there are equally appreciative tones in his reading of art. It might be (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  12.  9
    Complexity of fundamental problems in probabilistic abstract argumentation: Beyond independence.Bettina Fazzinga, Sergio Flesca & Filippo Furfaro - 2019 - Artificial Intelligence 268 (C):1-29.
  13.  5
    Music Classification and Detection of Location Factors of Feature Words in Complex Noise Environment.Yulan Xu & Qiaowei Li - 2021 - Complexity 2021:1-12.
    In order to solve the problem of the influence of feature word position in lyrics on music emotion classification, this paper designs a music classification and detection model in complex noise environment. Firstly, an intelligent detection algorithm for electronic music signals under complex noise scenes is proposed, which can solve the limitations existing in the current electronic music signal detection process. At the same time, denoising technology is introduced to eliminate the noise and extract the features from the signal. (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  14.  72
    The complexity of classification problems for models of arithmetic.Samuel Coskey & Roman Kossak - 2010 - Bulletin of Symbolic Logic 16 (3):345-358.
    We observe that the classification problem for countable models of arithmetic is Borel complete. On the other hand, the classification problems for finitely generated models of arithmetic and for recursively saturated models of arithmetic are Borel; we investigate the precise complexity of each of these. Finally, we show that the classification problem for pairs of recursively saturated models and for automorphisms of a fixed recursively saturated model are Borel complete.
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  15.  12
    Complexity of some problems in modal and superintuitionistic logics.Larisa Maksimova & Andrei Voronkov - 2000 - Bulletin of Symbolic Logic 6:118-119.
  16.  29
    Complexity of a problem of energy efficient real-time task scheduling on a multicore processor.Abhishek Mishra & Anil Kumar Tripathi - 2016 - Complexity 21 (1):259-267.
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  17.  36
    Descriptive complexity of modularity problems on graphs.Haroldo G. Benatti & Ruy Jgb de Queiroz - 2005 - Bulletin of the Section of Logic 34 (2):61-75.
  18.  5
    Linguistic Problems in the Investigation of Chinese Philosophy.Нanna Hnatovska & Vasyl Havronenko - 2023 - Bulletin of Taras Shevchenko National University of Kyiv Philosophy 2 (9):13-19.
    B a c k g r o u n d. The article is devoted to the analysis of the key directions of the study of the possible influence of the specifics of Chinese language culture on the content and nature of intellectual discourse, which is recognized as philosophical. Logic and ontology are the key areas of analysis of the possible influence of linguistic determinants on the intellectual discourse of China. Three main topics that attract the attention of researchers are the (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  19.  28
    The R. E. Complexity of Decision Problems for Commutative Semi-Thue Systems With Recursive Rule Set.Egon Börger & Hans Kleine Büning - 1980 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 26 (28-30):459-469.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  20. The Problem of Induction and the Problem of Free Will.Avijit Lahiri - manuscript
    This essay presents a point of view for looking at `free will', with the purpose of interpreting where exactly the freedom lies. For, freedom is what we mean by it. It compares the exercise of free will with the making of inferences, which usually is predominantly inductive in nature. The making of inference and the exercise of free will, both draw upon psychological resources that define our ‘selves’. I examine the constitution of the self of an individual, especially the involvement (...)
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  21.  27
    Internal Perception: The Role of Bodily Information in Concepts and Word Mastery.Luigi Pastore & Sara Dellantonio - 2017 - Berlin, Heidelberg: Springer Berlin Heidelberg. Edited by Luigi Pastore.
    Chapter 1 First Person Access to Mental States. Mind Science and Subjective Qualities -/- Abstract. The philosophy of mind as we know it today starts with Ryle. What defines and at the same time differentiates it from the previous tradition of study on mind is the persuasion that any rigorous approach to mental phenomena must conform to the criteria of scientificity applied by the natural sciences, i.e. its investigations and results must be intersubjectively and publicly controllable. In Ryle’s view, philosophy (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  22.  9
    Fine Degrees of Word Problems of Cancellation Semigroups.Carl G. Jockusch - 1980 - Mathematical Logic Quarterly 26 (1‐6):93-95.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  23.  23
    Fine Degrees of Word Problems of Cancellation Semigroups.Carl G. Jockusch - 1980 - Mathematical Logic Quarterly 26 (1-6):93-95.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  24.  10
    The complexity of decision problems about equilibria in two-player Boolean games.Egor Ianovski & Luke Ong - 2018 - Artificial Intelligence 261 (C):1-15.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  25. 1 Complexity of Computational Problems.D. B. Shmoys & E. Tardos - forthcoming - Complexity.
  26.  34
    Methodological Problems of Mathematical Modeling in Natural Science.I. A. Akchurin, M. F. Vedenov & Iu V. Sachkov - 1966 - Russian Studies in Philosophy 5 (2):23-34.
    The constantly accelerating progress of contemporary natural science is indissolubly associated with the development and use of mathematics and with the processes of mathematical modeling of the phenomena of nature. The essence of this diverse and highly fertile interaction of mathematics and natural science and the dialectics of this interaction can only be disclosed through analysis of the nature of theoretical notions in general. Today, above all in the ranks of materialistically minded researchers, it is generally accepted that theory possesses (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  27.  15
    Problems with Pronunciation Among Students of English Language and Literature-Seeu.Arta Toçi - 2020 - Seeu Review 15 (2):113-125.
    Everybody who has learned English as a second or foreign language knows that for reaching intermediate levels, English is an easy language regarding grammar and vocabulary; however, when reaching advanced levels, the learners are faced with complex forms of morphology, syntax, and most obviously, they are faced with the difficulties that pronunciation presents. These are mainly the problems that occur with the English students whose native language is other than English. An experienced teacher of non-native speakers of English can (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  28.  12
    The Problem of Existence of Virtual Objects from the Philosophical Perspective.Mariusz Mazurek - 2022 - Filozofia i Nauka 10:137-156.
    I consider the problem of existence of virtual objects, mainly their mode of existence, while omitting the issue of the criteria of their existence. I present and analyze the concepts of modes of existence of virtual objects proposed in the literature of the subject, and then I demonstrate my own position on the issue. My position on the existence of virtual objects has certain points coinciding with the already postulated views, but at the same time it differs from them in (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  29.  8
    The Problem of Existence of Virtual Objects from the Philosophical Perspective.Mariusz Mazurek - 2022 - Filozofia i Nauka. Studia Filozoficzne I Interdyscyplinarne 10:137-156.
    I consider the problem of existence of virtual objects, mainly their mode of existence, while omitting the issue of the criteria of their existence. I present and analyze the concepts of modes of existence of virtual objects proposed in the literature of the subject, and then I demonstrate my own position on the issue. My position on the existence of virtual objects has certain points coinciding with the already postulated views, but at the same time it differs from them in (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  30.  13
    Computational complexity on computable metric spaces.Klaus Weirauch - 2003 - Mathematical Logic Quarterly 49 (1):3-21.
    We introduce a new Turing machine based concept of time complexity for functions on computable metric spaces. It generalizes the ordinary complexity of word functions and the complexity of real functions studied by Ko [19] et al. Although this definition of TIME as the maximum of a generally infinite family of numbers looks straightforward, at first glance, examples for which this maximum exists seem to be very rare. It is the main purpose of this paper to (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  31. Magic words: How language augments human computation.Andy Clark - 1998 - In Peter Carruthers & Jill Boucher (eds.), Language and Thought: Interdisciplinary Themes. Cambridge: Cambridge University Press. pp. 162-183.
    Of course, words aren’t magic. Neither are sextants, compasses, maps, slide rules and all the other paraphenelia which have accreted around the basic biological brains of homo sapiens. In the case of these other tools and props, however, it is transparently clear that they function so as to either carry out or to facilitate computational operations important to various human projects. The slide rule transforms complex mathematical problems (ones that would baffle or tax the unaided subject) into simple tasks (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   98 citations  
  32. The complexity of the soul and the problem of unity in the thirteenth century.Andrew Arlig - 2018 - In Margaret Cameron (ed.), Philosophy of Mind in the Early and High Middle Ages: The History of the Philosophy of Mind. New York: Routledge.
     
    Export citation  
     
    Bookmark  
  33.  9
    Borrowed Words: problems of vocabulary in eighteenth-century geology.Rhoda Rappaport - 1982 - British Journal for the History of Science 15 (1):27-44.
    Every science has its technical vocabulary, consisting in part of terms coined for explicit purposes and in part of words borrowed from ordinary discourse and used with greater or lesser degrees of precision. Words of the latter sort pose curious problems, some of them familiar to those historians of science concerned with, for example, what Galileo meant by forza and Newton by attraction. Indeed, analogous problems face any historian seeking to understand the older meanings of terms still in (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  34.  7
    The complexity of some polynomial network consistency algorithms for constraint satisfaction problems.Alan K. Mackworth & Eugene C. Freuder - 1985 - Artificial Intelligence 25 (1):65-74.
  35.  28
    Complexity of interpolation and related problems in positive calculi.Larisa Maksimova - 2002 - Journal of Symbolic Logic 67 (1):397-408.
    We consider the problem of recognizing important properties of logical calculi and find complexity bounds for some decidable properties. For a given logical system L, a property P of logical calculi is called decidable over L if there is an algorithm which for any finite set Ax of new axiom schemes decides whether the calculus L + Ax has the property P or not. In [11] the complexity of tabularity, pre-tabularity, and interpolation problems over the intuitionistic logic (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  36.  2
    The Geschlecht Complex: Addressing Untranslatable Aspects of Gender, Genre, and Ontology.Oscar Jansson & David LaRocca (eds.) - 2022 - Bloomsbury Publishing USA.
    "The notion of Geschlecht - denoting gender, genre, kinship, and more - exemplifies the most pertinent questions of the transnational and transdisciplinary structures of contemporary humanities. What happens in the transference from one language, tradition, or form to another? Combining detailed case studies of "category problems" in literature, philosophy, theatre, media, cinema, and performing arts, with excerpts from canonical texts-by field-defining thinkers such as Derrida, Malabou, Nancy, and Irigaray-the volume presents "the Geschlecht complex" as a fulcrum for any interpretive (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  37.  29
    The complexity of recursive constraint satisfaction problems.Victor W. Marek & Jeffrey B. Remmel - 2010 - Annals of Pure and Applied Logic 161 (3):447-457.
    We investigate the complexity of finding solutions to infinite recursive constraint satisfaction problems. We show that, in general, the problem of finding a solution to an infinite recursive constraint satisfaction problem is equivalent to the problem of finding an infinite path through a recursive tree. We also identify natural classes of infinite recursive constraint satisfaction problems where the problem of finding a solution to the infinite recursive constraint satisfaction problem is equivalent to the problem of finding an (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  38.  33
    Manipulations of word frequency reveal differences in the processing of morphologically complex and simple words in German.Maria Bronk, Pienie Zwitserlood & Jens Bölte - 2013 - Frontiers in Psychology 4.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  39.  13
    Processing of Words Related to the Demands of a Previously Solved Problem.Marek Kowalczyk - 2014 - Polish Psychological Bulletin 45 (2):179-191.
    Earlier research by the author brought about findings suggesting that people in a special way process words related to demands of a problem they previously solved, even when they do not consciously notice this relationship. The findings concerned interference in the task in which the words appeared, a shift in affective responses to them that depended on sex of the participants, and impaired memory of the words. The aim of this study was to replicate these effects and to find out (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  40. Of arithmetic word problems.Denise Dellarosa Cummins - unknown
    Two experiments were conducted to investigate children’s interpretations of standard arithmetic word problems and the factors that influence their interpretations. In Experiment 1, children were required to solve a series of problems and then to draw and select pictures that represented the problems’ structures. Solution performance was found to vary systematically with the nature of the representations drawn and chosen. The crucial determinant of solution success was the interpretation a child assigned to certain phrases used in (...)
    No categories
     
    Export citation  
     
    Bookmark  
  41.  24
    Word problems: a review of linguistic and numerical factors contributing to their difficulty. [REVIEW]Gabriella Daroczy, Magdalena Wolska, Walt Detmar Meurers & Hans-Christoph Nuerk - 2015 - Frontiers in Psychology 6.
  42.  28
    Associations, sets, and the solution of word problems.Miriam A. Safren - 1962 - Journal of Experimental Psychology 64 (1):40.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  43.  37
    The Problem of Affects in Aesthetics.Elga Freiberga - 2008 - Proceedings of the Xxii World Congress of Philosophy 1:79-86.
    I was more excited by Jacques Ranciere’s idea about aesthetics being, in his opinion, a special way of thinking (mode de pensee) that works of art provoke and that tends to show what they are like as art objects. Aesthetics then (following this intention) would not be viewed as a discipline akin to art theory that wouldexamine the structure of the work of art, its peculiarities, conditions of arising, et cetera, all that attests either to its objectivity or subjectivity. Ranciere (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  44. An empiricist schema of the psychophysical problem.Gustav Bergmann - 1942 - Philosophy of Science 9 (January):72-91.
    This paper does not purport to present a fully developed argument. Rather, it intends to delineate, in broad strokes and in a synoptic manner, the total frame of reference of Scientific Empiricism as far as it is necessary for an integration of the several contributory clarifications of the complex, usually referred to as the psychophysical problem. Several considerations seem to justify such an attempt. It is desirable, from time to time, to free the results of logical and methodological analysis from (...)
    Direct download (10 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  45.  5
    The complexity of constraint satisfaction problems for small relation algebras.M. Cristani & R. Hirsch - 2004 - Artificial Intelligence 156 (2):177-196.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  46. Quantum-information conservation. The problem about “hidden variables”, or the “conservation of energy conservation” in quantum mechanics: A historical lesson for future discoveries.Vasil Penchev - 2020 - Energy Engineering (Energy) eJournal (Elsevier: SSRN) 3 (78):1-27.
    The explicit history of the “hidden variables” problem is well-known and established. The main events of its chronology are traced. An implicit context of that history is suggested. It links the problem with the “conservation of energy conservation” in quantum mechanics. Bohr, Kramers, and Slaters (1924) admitted its violation being due to the “fourth Heisenberg uncertainty”, that of energy in relation to time. Wolfgang Pauli rejected the conjecture and even forecast the existence of a new and unknown then elementary particle, (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  47.  39
    The length of words reflects their conceptual complexity.Molly L. Lewis & Michael C. Frank - 2016 - Cognition 153 (C):182-195.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   19 citations  
  48. The role of understanding in solving word problems.Drzmsra Dellarosa Cummins - unknown
    Word problems are notoriously difficult to solve. We suggest that much of the difficulty children experience with word problems can be attributed to difficulty in comprehending abstract or ambiguous language. We tested this hypothesis by (1) requiring children to recall problems either before or after solving them, (2) requiring them to generate f'mal questions to incomplete word problems, and (3) modeling performance pattems using a computer simulation. Solution performance was found to be systematically (...)
     
    Export citation  
     
    Bookmark   12 citations  
  49. Names of Words: A Note on Analysis "Problem" no. 10.C. H. Whiteley - 1956 - Analysis 17 (5):119 - 120.
  50. Names of Words: A Note on Analysis "Problem" no. 10.C. H. Whiteley - 1956 - Analysis 17 (5):119.
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
1 — 50 / 1000