Results 231 to 240 of about 1,794,096 (279)
Computer-based testing in higher education: a phenomenology investigation into undergraduate students' perspectives through the technology acceptance model. [PDF]
Front PsycholZakariya YF +3 more
europepmc +1 more source
Theoretical Computer Science: Preface
, 2004 Emiris, I.Z., Mourrain, B., Pan, V.Y.
openaire +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
2008
This chapter provides a self-contained introduction to a collection of topics in computer science that focusses on the abstract, logical, and mathematical aspects of computing. First, mathematical structures called graphs are described that are used to model pairwise relations between objects from a certain collection.
PIETRACAPRINA, ANDREA ALBERTO +3 more
+5 more sources
This chapter provides a self-contained introduction to a collection of topics in computer science that focusses on the abstract, logical, and mathematical aspects of computing. First, mathematical structures called graphs are described that are used to model pairwise relations between objects from a certain collection.
PIETRACAPRINA, ANDREA ALBERTO +3 more
+5 more sources
2017
We introduce specular sets. These are subsets of groups which form a natural generalization of free groups. These sets of words are an abstract generalization of the natural codings of interval exchanges and of linear involutions. We consider two important families of sets contained in specular sets: sets of return words and maximal bifix codes.
Berthé, V. +7 more
openaire +2 more sources
We introduce specular sets. These are subsets of groups which form a natural generalization of free groups. These sets of words are an abstract generalization of the natural codings of interval exchanges and of linear involutions. We consider two important families of sets contained in specular sets: sets of return words and maximal bifix codes.
Berthé, V. +7 more
openaire +2 more sources
Theoretical Computer Science: Computational Complexity
2020How much time, space and/or hardware resource does require an algorithm? Such questions lead to surprising results: conceptual simplicity does not always go along with efficiency. A lot of quite natural questions remain open, e.g., the famous P \(=\) NP problem raised in 1970.
Bournez, Olivier +6 more
openaire +3 more sources