LEADER 01145nam2-2200361li-450 001 990000224780203316 005 20180312154829.0 035 $a0022478 035 $aUSA010022478 035 $a(ALEPH)000022478USA01 035 $a0022478 100 $a20001109d1969----km-y0itay0103----ba 101 0 $afre 102 $aFR 200 1 $aSéries de Dirichlet$eprincipes et méthodes$fS. Mandelbrojt 210 $aParis: Gauthier-Villars$dcopyr. 1969 215 $aX, 166 p.$cill.$d23 cm. 225 2 $aMonographies internationales de mathématiques modernes$v11 410 0$10010022479$12001$aMonographies internationales de mathématiques modernes 610 1 $aserie (matematica) 676 $a515243$9Serie 700 1$aMandelbrojt,$bS.$041083 801 $aSistema bibliotecario di Ateneo dell' Università di Salerno$gRICA 912 $a990000224780203316 951 $a515. 243 MAN$b0016560 959 $aBK 969 $aSCI 979 $c19970122 979 $c20001110$lUSA01$h1714 979 $c20020403$lUSA01$h1630 979 $aPATRY$b90$c20040406$lUSA01$h1616 996 $aSeries de Dirichlet$9339262 997 $aUNISA LEADER 06465nam 22008175 450 001 9910484593503321 005 20251226202836.0 010 $a3-540-31580-2 024 7 $a10.1007/11527695 035 $a(CKB)1000000000232415 035 $a(SSID)ssj0000320380 035 $a(PQKBManifestationID)11238879 035 $a(PQKBTitleCode)TC0000320380 035 $a(PQKBWorkID)10247314 035 $a(PQKB)11619008 035 $a(DE-He213)978-3-540-31580-3 035 $a(MiAaPQ)EBC3068404 035 $a(PPN)123096219 035 $a(BIP)12712373 035 $a(EXLCZ)991000000000232415 100 $a20101220d2005 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aTheory and Applications of Satisfiability Testing $e7th International Conference, SAT 2004, Vancouver, BC, Canada, May 10-13, 2004, Revised Selected Papers /$fedited by Holger H. Hoos, David G. Mitchell 205 $a1st ed. 2005. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2005. 215 $a1 online resource (XIII, 393 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3542 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-27829-X 320 $aIncludes bibliographical references and index. 327 $aMapping Problems with Finite-Domain Variables to Problems with Boolean Variables -- Mapping Problems with Finite-Domain Variables to Problems with Boolean Variables -- A SAT-Based Decision Procedure for the Boolean Combination of Difference Constraints -- An Algebraic Approach to the Complexity of Generalized Conjunctive Queries -- Incremental Compilation-to-SAT Procedures -- Resolve and Expand -- Looking Algebraically at Tractable Quantified Boolean Formulas -- Derandomization of Schuler?s Algorithm for SAT -- Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank -- QBF Reasoning on Real-World Instances -- Automatic Extraction of Functional Dependencies -- Algorithms for Satisfiability Using Independent Sets of Variables -- Aligning CNF- and Equivalence-Reasoning -- Using DPLL for Efficient OBDD Construction -- Approximation Algorithm for Random MAX-kSAT -- Clause Form Conversions for Boolean Circuits -- From Spin Glasses to Hard Satisfiable Formulas -- CirCUs: A Hybrid Satisfiability Solver -- Equivalence Models for Quantified Boolean Formulas -- Search vs. Symbolic Techniques in Satisfiability Solving -- Worst Case Bounds for Some NP-Complete Modified Horn-SAT Problems -- Satisfiability Threshold of the Skewed Random k-SAT -- NiVER: Non-increasing Variable Elimination Resolution for Preprocessing SAT Instances -- Analysis of Search Based Algorithms for Satisfiability of Propositional and Quantified Boolean Formulas Arising from Circuit State Space Diameter Problems -- UBCSAT: An Implementation and Experimentation Environment for SLS Algorithms for SAT and MAX-SAT -- SAT Solver Competition and QBF Solver Evaluation (Invited Papers) -- Fifty-Five Solvers in Vancouver: The SAT 2004 Competition -- March_eq: Implementing Additional Reasoning into an Efficient Look-Ahead SATSolver -- Zchaff2004: An Efficient SAT Solver -- The Second QBF Solvers Comparative Evaluation. 330 $aThe 7th International Conference on Theory and Applications of Satis'ab- ity Testing (SAT 2004) was held 10-13 May 2004 in Vancouver, BC, Canada. The conference featured 9 technical paper sessions, 2 poster sessions, as well as the 2004 SAT Solver Competition and the 2004 QBF Solver Evaluation. It also included invited talks by Stephen A. Cook (University of Toronto) and Kenneth McMillan (Cadence Berkeley Labs). The 89 participants represented no less than 17 countries and four continents. SAT 2004 continued the series of meetings which started with the Workshops on Satis'ability held in Siena, Italy (1996), Paderborn, Germany (1998) and Renesse, The Netherlands (2000); the Workshop on Theory and Applications of Satis'ability Testing held in Boston, USA(2001);theSymposiumonTheoryandApplicationsofSatis'abilityTesting held in Cincinnati, USA (2002); and the 6th International Conference on Theory and Applications of Satis'ability Testing held in Santa Margherita Ligure, Italy (2003). The International Conference on Theory and Applications of Satis'ability Testing is the primary annual meeting for researchers studying the propo- tional satis'ability problem (SAT), a prominent problem in both theoretical and applied computer science. SAT lies at the heart of the most important open problem in complexity theory (P vsNP) and underlies many applications in, among other examples, arti'cial intelligence, operations research and electronic design engineering. The primary objective of the conferences is to bring together researchersfromvariousareasandcommunities,includingtheoreticalandexp- imental computer science as well as many relevant application areas, to promote collaboration and the communication of new theoretical and practical results in SAT-related research and its industrial applications. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3542 606 $aMachine theory 606 $aAlgorithms 606 $aOperating systems (Computers) 606 $aNumerical analysis 606 $aArtificial intelligence 606 $aMathematical logic 606 $aFormal Languages and Automata Theory 606 $aAlgorithms 606 $aOperating Systems 606 $aNumerical Analysis 606 $aArtificial Intelligence 606 $aMathematical Logic and Foundations 615 0$aMachine theory. 615 0$aAlgorithms. 615 0$aOperating systems (Computers). 615 0$aNumerical analysis. 615 0$aArtificial intelligence. 615 0$aMathematical logic. 615 14$aFormal Languages and Automata Theory. 615 24$aAlgorithms. 615 24$aOperating Systems. 615 24$aNumerical Analysis. 615 24$aArtificial Intelligence. 615 24$aMathematical Logic and Foundations. 676 $a511.3 701 $aHoos$b Holger H$01657174 701 $aMitchell$b David G.$cPh. D.$01757084 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484593503321 996 $aTheory and applications of satisfiability testing$94194730 997 $aUNINA