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; zbMATH DE number 1303594

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

zbMath0936.68113MaRDI QIDQ4250220

Edward A. Hirsch

Publication date: 18 May 2000


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

zbMATH Keywords

SAT algorithms


Mathematics Subject Classification ID

Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).


Related Items (11)

An improved upper bound for SAT ⋮ Matching Triangles and Basing Hardness on an Extremely Popular Conjecture ⋮ Local search algorithms for SAT: Worst-case analysis ⋮ An Improved SAT Algorithm in Terms of Formula Length ⋮ Further improvements for SAT in terms of formula length ⋮ New methods for 3-SAT decision and worst-case analysis ⋮ Separating signs in the propositional satisfiability problem ⋮ Toward Tight Approximation Bounds for Graph Diameter and Eccentricities ⋮ Faster exact solutions for some NP-hard problems. ⋮ Which problems have strongly exponential complexity? ⋮ A fast algorithm for SAT in terms of formula length




This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4250220&oldid=18141995"
Category:
  • Pages with script errors
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 6 February 2024, at 16:24.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki