Results 71 to 80 of about 6,830,035 (189)
The Hard Problem Of Content: Solved (Long Ago)
Studies in Logic, Grammar and Rhetoric, 2015 In this paper, I argue that even if the Hard Problem of Content, as identified by Hutto and Myin, is important, it was already solved in naturalized semantics, and satisfactory solutions to the problem do not rely merely on the notion of information as ...
Miłkowski Marcin
doaj +1 more source
Journal of Symbolic Computation, 1994 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
K.R. Apt (Krzysztof) +2 more
openaire +5 more sources
Reducing the rank of a matroid [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 We consider the rank reduction problem for matroids: Given a matroid $M$ and an integer $k$, find a minimum size subset of elements of $M$ whose removal reduces the rank of $M$ by at least $k$. When $M$ is a graphical matroid this problem is the minimum $
Gwenaël Joret, Adrian Vetta
doaj +1 more source
A neuroscientific hypothesis on the physical nature of consciousness
Frontiers in Human NeuroscienceThis study addresses a central question in neuroscience: What is the physical nature of consciousness? Taking a neuroscientific approach, the study first establishes working definitions for its principal terms—qualia, consciousness, and information—to ...
Chirapat Ukachoke
doaj +1 more source
, 2023 League-ally Speaking was a newsletter published by the Toledo League for the Hard of Hearing in Toledo, Ohio. Incorporated in 1920, the organization was also an agency of the Toledo Community Chest. In 1947 the organization changed its name to the Toledo
Toledo League for the Hard of Hearing
core
The Jacobi Symbol Problem for Quadratic Congruences and Applications to Cryptography
MathematicsModern security models for public-key cryptography, such as one-way encryption under chosen plaintext attack (OWE-CPA) or indistinguishability under chosen plaintext attack (IND-CPA), rely on reductions between the security of cryptographic schemes and ...
Ferucio Laurenţiu Ţiplea
doaj +1 more source
, 2023 League-ally Speaking was a newsletter published by the Toledo League for the Hard of Hearing in Toledo, Ohio. Incorporated in 1920, the organization was also an agency of the Toledo Community Chest. In 1947 the organization changed its name to the Toledo
Toledo League for the Hard of Hearing
core
The Straight-Line RAC Drawing Problem is NP-Hard
Journal of Graph Algorithms and Applications, 2012 A RAC drawing of a graph is a polyline drawing in which every pair of crossing edges intersects at right angle. In this paper, we focus on straight-line RAC drawings and demonstrate an infinite class of graphs with unique RAC combinatorial embedding.
Evmorfia Argyriou +2 more
doaj +1 more source
Phase transitions in project scheduling. [PDF]
The analysis of the complexity of combinatorial optimization problems has led to the distinction between problems which are solvable in a polynomially bounded amount of time (classified in P) and problems which are not (classified in NP).
De Reyck, B, Herroelen, Willy
core
, 2023 League-ally Speaking was a newsletter published by the Toledo League for the Hard of Hearing in Toledo, Ohio. Incorporated in 1920, the organization was also an agency of the Toledo Community Chest. In 1947 the organization changed its name to the Toledo
Toledo League for the Hard of Hearing
core