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

Theory and Applications of Satisfiability Testing

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

DOI10.1007/b95238zbMath1204.68209OpenAlexW2494235144WikidataQ56039662 ScholiaQ56039662MaRDI QIDQ5325876

Daniele Pretolani

Publication date: 24 July 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b95238



Mathematics Subject Classification ID

Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)


Related Items (2)

Optimization and probabilistic satisfiability on nested and co-nested formulas ⋮ On the complexity of strongly connected components in directed hypergraphs




This page was built for publication: Theory and Applications of Satisfiability Testing

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