Abstract - PDFSEARCH.IO - Document Search Engine

Abstract
Results: 68258

#	Item
321	QUASI-ISOMETRICALLY EMBEDDED FREE SUB-SEMIGROUPS YVES DE CORNULIER, ROMAIN TESSERA Abstract. If G is either a connected Lie group, or a finitely generated solvable group with exponential growth, we show that G contains a Add to Reading List Source URL: www.normalesup.org Language: English - Date: 2006-12-14 15:44:46 Algebra Abstract algebra Mathematics Metric geometry Semigroup theory Algebraic structures Equivalence Geometric group theory Semigroup Nilpotent group Valuation ring Isometry
322	Tutorial to Locales and Locale Interpretation∗ Clemens Ballarin Abstract Locales are Isabelle’s approach for dealing with parametric theories. They have been designed as a module system for a theorem prover Add to Reading List Source URL: mirror.clarkson.edu Language: English - Date: 2018-08-15 07:19:09 Mathematics Order theory Algebra Abstract algebra Lattice theory Mathematical logic Algebraic structures Predicate logic Distributive lattice Complete Heyting algebra Mereology Partially ordered set
323	Temporal Inference In Forward Search Temporal Planning Dissertation Abstract Atif Talukdar Supervisors: Maria Fox and Derek Long King’s College London London WC2R 2LS Add to Reading List Source URL: icaps16.icaps-conference.org Language: English - Date: 2016-06-09 08:09:43 Logic Metaphysics Philosophy of science Theoretical philosophy Reasoning Logic in computer science Expert systems Inference Logical consequence Causality Automated planning and scheduling Forward chaining
324	Area 2 (Programming Techniques and the Web) Danny Yoo () Abstract The object capability (ocap) community uses Y-URLs (yurls) as a means of extending the ocap paradigm to the distributed world of the Web. L Add to Reading List Source URL: www.hashcollision.org Language: English Computing World Wide Web Uniform Resource Locator Network architecture Internet protocols Continuation Control flow Hypertext Transfer Protocol Web server Server HTTP referer
325	BDDs for Pseudo-Boolean Constraints – Revisited Ignasi Ab´ıo, Robert Nieuwenhuis, Albert Oliveras, and Enric Rodr´ıguez-Carbonell? Abstract. Pseudo-Boolean constraints are omnipresent in practical applications, and Add to Reading List Source URL: www.lsi.upc.edu Language: English - Date: 2011-11-02 09:48:19 Boolean algebra Constraint programming Diagrams Binary decision diagram Model checking Theoretical computer science Mathematics Local consistency Computing Propositional directed acyclic graph
326	Left inverses of matrices with polynomial decay. Romain Tessera∗ July 21, 2010 Abstract It is known that the algebra of Schur operators on `2 (namely operators Add to Reading List Source URL: www.normalesup.org Language: English - Date: 2010-07-21 23:28:46 Mathematical analysis Mathematics Functional analysis Operator theory Algebra Mathematical notation Operator Matrix Pseudo-differential operator Bounded operator Banach algebra Mutation
327	Tutorial to Locales and Locale Interpretation∗ Clemens Ballarin Abstract Locales are Isabelle’s approach for dealing with parametric theories. They have been designed as a module system for a theorem prover Add to Reading List Source URL: www.cl.cam.ac.uk Language: English - Date: 2018-08-15 07:19:09 Mathematics Order theory Algebra Abstract algebra Lattice theory Mathematical logic Algebraic structures Predicate logic Distributive lattice Complete Heyting algebra Mereology Partially ordered set
328	On Quantitative Software Verification Marta Kwiatkowska Oxford University Computing Laboratory, Parks Road, Oxford, OX1 3QD Abstract: Software verification has made great progress in recent years, resulting in several to Add to Reading List Source URL: qav.comlab.ox.ac.uk Language: English - Date: 2009-07-29 05:44:10 Formal methods Model checkers Metaphysics Model checking Theoretical computer science PRISM model checker Computing Refinement Abstraction Markov chain Stochastic
329	Quantum FHE (Almost) As Secure as Classical Zvika Brakerski∗ Abstract Fully homomorphic encryption schemes (FHE) allow to apply arbitrary efficient computation to encrypted data without decrypting it first. In Quantum Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2018-04-10 03:50:18 Cryptography Post-quantum cryptography Lattice-based cryptography Models of computation Homeomorphisms Homomorphic encryption Quantum computing Lattice Learning with errors RSA One-time pad Quantum circuit

UPDATE