LEADER 05007nam 22007455 450 001 996465855203316 005 20230220232701.0 010 $a1-280-38667-3 010 $a9786613564597 010 $a3-642-13182-4 024 7 $a10.1007/978-3-642-13182-0 035 $a(CKB)2670000000028930 035 $a(SSID)ssj0000446370 035 $a(PQKBManifestationID)11282009 035 $a(PQKBTitleCode)TC0000446370 035 $a(PQKBWorkID)10506312 035 $a(PQKB)10058904 035 $a(DE-He213)978-3-642-13182-0 035 $a(MiAaPQ)EBC3065372 035 $a(PPN)149063423 035 $a(EXLCZ)992670000000028930 100 $a20100612d2010 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aComputer Science -- Theory and Applications$b[electronic resource] $e5th International Computer Science Symposium in Russia, CSR 2010, Kazan, Russia, June 16-20, 2010, Proceedings /$fedited by Farid M. Ablaev, Ernst W. Mayr 205 $a1st ed. 2010. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2010. 215 $a1 online resource (XI, 397 p. 49 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6072 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-13181-6 320 $aIncludes bibliographical references and index. 327 $aAlgorithms for Energy Management -- Sofic and Almost of Finite Type Tree-Shifts -- Proof-Based Design of Security Protocols -- Approximating the Minimum Length of Synchronizing Words Is Hard -- Realizability of Dynamic MSC Languages -- The max quasi-independent set Problem -- Equilibria in Quantitative Reachability Games -- Quotient Complexity of Closed Languages -- Right-Sequential Functions on Infinite Words -- Kernelization -- Zigzags in Turing Machines -- Frameworks for Logically Classifying Polynomial-Time Optimisation Problems -- Validating the Knuth-Morris-Pratt Failure Function, Fast and Online -- Identical Relations in Symmetric Groups and Separating Words with Reversible Automata -- Time Optimal d-List Colouring of a Graph -- The Cantor Space as a Generic Model of Topologically Presented Knowledge -- Algorithmics ? Is There Hope for a Unified Theory? -- Classifying Rankwidth k-DH-Graphs -- Lower Bound on Average-Case Complexity of Inversion of Goldreich?s Function by Drunken Backtracking Algorithms -- A SAT Based Effective Algorithm for the Directed Hamiltonian Cycle Problem -- Balancing Bounded Treewidth Circuits -- Obtaining Online Ecological Colourings by Generalizing First-Fit -- Classical Simulation and Complexity of Quantum Computations -- Prefix-Free and Prefix-Correct Complexities with Compound Conditions -- Monotone Complexity of a Pair -- Symbolic Models for Single-Conclusion Proof Logics -- Complexity of Problems Concerning Carefully Synchronizing Words for PFA and Directing Words for NFA -- Advancing Matrix Computations with Randomized Preprocessing -- Transfinite Sequences of Constructive Predicate Logics -- The Quantitative Analysis of User Behavior Online ? Data, Models and Algorithms -- A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem -- Complexity of Propositional Proofs -- Quantization of Random Walks: Search Algorithms and Hitting Time -- Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems -- Growth of Power-Free Languages over Large Alphabets -- A Partially Synchronizing Coloring -- An Encoding Invariant Version of Polynomial Time Computable Distributions -- Prehistoric Phenomena and Self-referentiality. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6072 606 $aComputer science 606 $aAlgorithms 606 $aMachine theory 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aTheory of Computation 606 $aAlgorithms 606 $aComputer Science Logic and Foundations of Programming 606 $aFormal Languages and Automata Theory 606 $aDiscrete Mathematics in Computer Science 615 0$aComputer science. 615 0$aAlgorithms. 615 0$aMachine theory. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 14$aTheory of Computation. 615 24$aAlgorithms. 615 24$aComputer Science Logic and Foundations of Programming. 615 24$aFormal Languages and Automata Theory. 615 24$aDiscrete Mathematics in Computer Science. 676 $a004.0151 702 $aAblaev$b Farid M$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aMayr$b Ernst W$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aInternational Computer Science Symposium in Russia 906 $aBOOK 912 $a996465855203316 996 $aComputer Science - Theory and Applications$92889860 997 $aUNISA LEADER 01994nam 2200385 450 001 996540330203316 005 20230711173345.0 010 $a9783956509278 035 $a(CKB)5710000000006740 035 $a(NjHacI)995710000000006740 035 $a(EXLCZ)995710000000006740 100 $a20230711d2022 uy 0 101 0 $ager 135 $aur||||||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$a"Wenn wir sagen, dass der Tropfen Mensch wird" $eVorstellungen ungeborenen Lebens bei Bar ?Ebra?ya? (1226-1286 n. Chr.) /$fFlorian Ja?ckel 210 1$aBaden-Baden :$cErgon Verlag,$d[2022] 215 $a1 Online Ressource 225 0 $aRecht, Ethik und Gesellschaft im Vorderen Orient, ;$vBand 2 311 $a3-95650-926-9 330 $a"Vorstellungen des Ungeborenen finden sich seit der Antike in medizinischen, philosophischen und theologischen Texten. Die bisherige Forschung untersucht Gemeinsamkeiten und Unterschiede dieser Vorstellungen in verschiedenen gelehrten und religio?sen Kontexten, weist allerdings fu?r die syrisch-christliche Literatur eine Leerstelle auf. Dieses Buch stellt einen grundlegenden Beitrag zum Schließen dieser Lu?cke und zur transkulturellen Philosophiegeschichte dar. Es untersucht mehrere wichtige Werke des bedeutenden Universalgelehrten Bar ?Ebra?ya? und zeichnet dessen literarische Bearbeitung griechisch-philosophischer, christlicher und islamischer Vorlagen zu einer eigensta?ndigen "embryologischen Synthese" nach"-- Provided by publisher. 606 $aFetus$xReligious aspects 606 $aTheology, Doctrinal$xHistory$yTo 1500 615 0$aFetus$xReligious aspects. 615 0$aTheology, Doctrinal$xHistory 676 $a306.6 700 $aJa?ckel$b Florian$01279715 801 0$bNjHacI 801 1$bNjHacl 906 $aBOOK 912 $a996540330203316 996 $a"Wenn wir sagen, dass der Tropfen Mensch wird"$93015883 997 $aUNISA