Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article

From MaRDI portal
Publication:2703800
Jump to:navigation, search

zbMath0963.00028MaRDI QIDQ2703800

No author found.

Publication date: 18 March 2001


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

ProceedingsWorkshopSatisfiabilitySAT 2000


Mathematics Subject Classification ID

Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06)


Related Items

Algorithms for Solving Satisfiability Problems with Qualitative Preferences, Answer set programming based on propositional satisfiability, Unnamed Item, Heuristic average-case analysis of the backtrack resolution of random 3-satisfiability instances, Approximating minimal unsatisfiable subformulae by means of adaptive core search, New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability, Restarts and exponential acceleration of the Davis-Putnam-Loveland-Logemann algorithm: A large deviation analysis of the generalized unit clause heuristic for random 3-SAT, A complete adaptive algorithm for propositional satisfiability



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2703800&oldid=15554096"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 12:03.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki