UPT Perpustakaan UNS

  • Beranda
  • Informasi
  • Berita
  • Bantuan
  • Pustakawan
  • Area Anggota
  • Pilih Bahasa :
    Bahasa Arab Bahasa Bengal Bahasa Brazil Portugis Bahasa Inggris Bahasa Spanyol Bahasa Jerman Bahasa Indonesia Bahasa Jepang Bahasa Melayu Bahasa Persia Bahasa Rusia Bahasa Thailand Bahasa Turki Bahasa Urdu

Pencarian berdasarkan :

SEMUA Pengarang Subjek ISBN/ISSN Pencarian Spesifik

Pencarian terakhir:

{{tmpObj[k].text}}
No image available for this title
Penanda Bagikan

E Book

Theory and Applications of Satisfiability Testing

SpringerLink (Online service) - Nama Orang; Hoos, Holger H. - Nama Orang; Mitchell, David G. - Nama Orang;

Mapping 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 SAT Solver -- Zchaff2004: An Efficient SAT Solver -- The Second QBF Solvers Comparative Evaluation.


Ketersediaan

Tidak ada salinan data

Informasi Detail
Judul Seri
-
No. Panggil
-
Penerbit
: .,
Deskripsi Fisik
XIII, 393 p.online resource.
Bahasa
English
ISBN/ISSN
9783540315803
Klasifikasi
005.131
Tipe Isi
-
Tipe Media
-
Tipe Pembawa
-
Edisi
1st ed. 2005.
Subjek
Artificial intelligence.
Algorithms.
Algorithm Analysis and Problem Complexity.
Mathematical logic.
Mathematical Logic and Formal Languages.
Mathematical Logic and Foundations.
Numerical analysis.
Numeric Computing.
Operating systems (Computers).
Operating Systems.
Info Detail Spesifik
-
Pernyataan Tanggungjawab
edited by Holger H. Hoos, David G. Mitchell.
Versi lain/terkait

Tidak tersedia versi lain

Lampiran Berkas
Tidak Ada Data
Komentar

Anda harus masuk sebelum memberikan komentar

UPT Perpustakaan UNS
  • Informasi
  • Layanan
  • Pustakawan
  • Area Anggota

Tentang Kami

UNSLA (UNS Library Automation) adalah sistem manajemen perpustakaan daring yang dikembangkan untuk mendukung layanan informasi, penelusuran koleksi, dan pengelolaan sumber daya pustaka di lingkungan Universitas Sebelas Maret. Menggunakan platform Senayan Library Management System (SLiMS), aplikasi ini memberikan kemudahan bagi pemustaka dan pustakawan dalam mengakses, mengelola, dan memanfaatkan koleksi perpustakaan secara cepat, akurat, dan terintegrasi.

Cari

masukkan satu atau lebih kata kunci dari judul, pengarang, atau subjek

Donasi untuk SLiMS Kontribusi untuk SLiMS?

© 2025 — Senayan Developer Community

Ditenagai oleh SLiMS
Pilih subjek yang menarik bagi Anda
  • Karya Umum
  • Filsafat
  • Agama
  • Ilmu-ilmu Sosial
  • Bahasa
  • Ilmu-ilmu Murni
  • Ilmu-ilmu Terapan
  • Kesenian, Hiburan, dan Olahraga
  • Kesusastraan
  • Geografi dan Sejarah
Icons made by Freepik from www.flaticon.com
Pencarian Spesifik
Kemana ingin Anda bagikan?