06238nam 2200577 a 450 991048362880332120200520144314.03-540-37793-X10.1007/11821069(CKB)1000000000283919(SSID)ssj0000318807(PQKBManifestationID)11265699(PQKBTitleCode)TC0000318807(PQKBWorkID)10336496(PQKB)10125720(DE-He213)978-3-540-37793-1(MiAaPQ)EBC3068133(PPN)123137659(EXLCZ)99100000000028391920060712d2006 uy 0engurnn|008mamaatxtccrMathematical foundations of computer science 2006 31th international symposium, MFCS 2006, Stara Lesna, Slovakia, August 28- September 1, 2006 : proceedings /Rastislav Kralovic, Pawe Urzyczyn (eds.)1st ed. 2006.Berlin ;New York Springer20061 online resource (XVI, 816 p.) Lecture notes in computer science,0302-9743 ;4162LNCS sublibrary. SL 1, Theoretical computer science and general issuesBibliographic Level Mode of Issuance: Monograph3-540-37791-3 Includes bibliographical references and index.Invited Talks -- A Core Calculus for Scala Type Checking -- Tree Exploration with an Oracle -- Distributed Data Structures: A Survey on Informative Labeling Schemes -- From Deduction Graphs to Proof Nets: Boxes and Sharing in the Graphical Presentation of Deductions -- The Structure of Tractable Constraint Satisfaction Problems -- On the Representation of Kleene Algebras with Tests -- From Three Ideas in TCS to Three Applications in Bioinformatics -- Contributed Papers -- Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-triangles -- Approximate Shortest Path Queries on Weighted Polyhedral Surfaces -- A Unified Construction of the Glushkov, Follow, and Antimirov Automata -- Algebraic Characterizations of Unitary Linear Quantum Cellular Automata -- A Polynomial Time Nilpotence Test for Galois Groups and Related Results -- The Multiparty Communication Complexity of Exact-T: Improved Bounds and New Problems -- Crochemore Factorization of Sturmian and Other Infinite Words -- Equations on Partial Words -- Concrete Multiplicative Complexity of Symmetric Functions -- On the Complexity of Limit Sets of Cellular Automata Associated with Probability Measures -- Coloring Random 3-Colorable Graphs with Non-uniform Edge Probabilities -- The Kleene Equality for Graphs -- On the Repetition Threshold for Large Alphabets -- Improved Parameterized Upper Bounds for Vertex Cover -- On Comparing Sums of Square Roots of Small Integers -- A Combinatorial Approach to Collapsing Words -- Optimal Linear Arrangement of Interval Graphs -- The Lempel-Ziv Complexity of Fixed Points of Morphisms -- Partially Commutative Inverse Monoids -- Learning Bayesian Networks Does Not Have to Be NP-Hard -- Lower Bounds for the Transition Complexity of NFAs -- Smart Robot Teams Exploring Sparse Trees -- k-Sets of Convex Inclusion Chains of Planar Point Sets -- Toward the Eigenvalue Power Law -- Multicast Transmissions in Non-cooperative Networks with a Limited Number of Selfish Moves -- Very Sparse Leaf Languages -- On the Correlation Between Parity and Modular Polynomials -- Optimally Fast Data Gathering in Sensor Networks -- Magic Numbers in the State Hierarchy of Finite Automata -- Online Single Machine Batch Scheduling -- Machines that Can Output Empty Words -- Completeness of Global Evaluation Logic -- NOF-Multiparty Information Complexity Bounds for Pointer Jumping -- Dimension Characterizations of Complexity Classes -- Approximation Algorithms and Hardness Results for Labeled Connectivity Problems -- An Expressive Temporal Logic for Real Time -- On Matroid Representability and Minor Problems -- Non-cooperative Tree Creation -- Guarantees for the Success Frequency of an Algorithm for Finding Dodgson-Election Winners -- Reductions for Monotone Boolean Circuits -- Generalised Integer Programming Based on Logically Defined Relations -- Probabilistic Length-Reducing Automata -- Sorting Long Sequences in a Single Hop Radio Network -- Systems of Equations over Finite Semigroups and the #CSP Dichotomy Conjecture -- Valiant’s Model: From Exponential Sums to Exponential Products -- A Reachability Algorithm for General Petri Nets Based on Transition Invariants -- Approximability of Bounded Occurrence Max Ones -- Fast Iterative Arrays with Restricted Inter-cell Communication: Constructions and Decidability -- Faster Algorithm for Bisimulation Equivalence of Normed Context-Free Processes -- Quantum Weakly Nondeterministic Communication Complexity -- Minimal Chordal Sense of Direction and Circulant Graphs -- Querying and Embedding Compressed Texts -- Lempel-Ziv Dimension for Lempel-Ziv Compression -- Characterizing Valiant’s Algebraic Complexity Classes -- The Price of Defense -- The Data Complexity of MDatalog in Basic Modal Logics -- The Complexity of Counting Functions with Easy Decision Version -- On Non-Interactive Zero-Knowledge Proofs of Knowledge in the Shared Random String Model -- Constrained Minimum Enclosing Circle with Center on a Query Line Segment -- Hierarchical Unambiguity -- An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the ?erny Conjecture -- On Genome Evolution with Innovation.Lecture notes in computer science ;4162.LNCS sublibrary.SL 1,Theoretical computer science and general issues.MFCS 2006Computer scienceMathematicsCongressesComputer scienceMathematics004.0151Kralovic Rastislav1762326Urzyczyn Pawe318886Symposium on Mathematical Foundations of Computer Science (1972- )MiAaPQMiAaPQMiAaPQBOOK9910483628803321Mathematical foundations of computer science 20064202186UNINA03015nam 22006135 450 991080011470332120251009082218.09783031381386303138138610.1007/978-3-031-38138-6(MiAaPQ)EBC31067581(Au-PeEL)EBL31067581(CKB)29755971000041(DE-He213)978-3-031-38138-6(EXLCZ)992975597100004120240113d2023 u| 0engurcn#||||||||txtrdacontentcrdamediacrrdacarrierThe Dizziness of Freedom in Kierkegaard and Sartre /by Riccardo Pugliese1st ed. 2023.Cham :Springer Nature Switzerland :Imprint: Palgrave Macmillan,2023.1 online resource (96 pages) illustrationsPrint version: Pugliese, Riccardo The Dizziness of Freedom in Kierkegaard and Sartre Cham : Palgrave Macmillan,c2024 9783031381379 Includes bibliographical references (pages 83-86) and index.Chapter 1: Existence as Possibility -- Chapter 2: Desperation as the Ultimate Aesthetic Stage -- Chapter 3: Choice of Oneself -- Chapter 4: Existentialism Overview -- Chapter 5: Existentialism and Human Existence -- Chapter 6: Transcendence and Freedom -- Chapter 7: Authenticity and Responsibility -- Chapter 8: Freedom as Destiny.This book investigates the concept of freedom as it has been defined by Søren Kierkegaard and some of existentialism’s major figures, including Jean-Paul Sartre. In an attempt to delineate an ontology of the human condition, special emphasis is placed on the ideas of choice, responsibility, and transcendence. The second part of the book focuses on existential freedom in what has been its most radical formulation by Sartre. A translation of Il sentimento paralizzante del possibile. La vertigine della libertà in Kierkegaard e Sartre (2022), this book brings cutting-edge contemporary Italian philosophy to English readers.Continental philosophyPhilosophyHistoryPhilosophy, Modern20th centuryPhilosophy, Modern19th centuryContinental PhilosophyHistory of PhilosophyPhilosophy of the 20th centuryPhilosophy of the 19th centuryContinental philosophy.PhilosophyHistory.Philosophy, ModernPhilosophy, ModernContinental Philosophy.History of Philosophy.Philosophy of the 20th century.Philosophy of the 19th century.320.011Pugliese Riccardo1587971MiAaPQMiAaPQMiAaPQBOOK9910800114703321The Dizziness of Freedom in Kierkegaard and Sartre3876772UNINA