Spelling suggestions: "subject:"urfüerfüllbarkeitsproblem."" "subject:"urfühållbarhetsproblem.""
1 |
Effizientes Verifizieren co-NP-vollständiger Probleme am Beispiel zufälliger 4-SAT-Formeln und uniformer HypergraphenSchädlich, Frank. January 2004 (has links) (PDF)
Chemnitz, Techn. Universiẗat, Diss., 2004.
|
2 |
Generalized satisfiability problemsReith, Steffen. Unknown Date (has links) (PDF)
University, Diss., 2001--Würzburg.
|
3 |
Boolsche Gleichungssysteme, SAT Solver und StromchiffrenPilz, Enrico. January 2008 (has links)
Ulm, Univ., Bachelorarbeit, 2008.
|
4 |
Speeding up XML querying satisfiability test & containment test of Xpath queries in the presence of XML schema definitionsGroppe, Jinghua January 2008 (has links)
Zugl.: Lübeck, Univ., Diss., 2008
|
5 |
WoLFram - a word level framework for formal verification and its applicationSülflow, André January 2010 (has links)
Zugl.: Bremen, Univ., Diss., 2010
|
6 |
The complexity of description logics with concrete domainsLutz, Carsten. Unknown Date (has links) (PDF)
Techn. Hochsch., Diss., 2002--Aachen.
|
7 |
Automated validation and verification of railway specific components and systemsKinder, Sebastian January 2007 (has links)
Zugl.: Bremen, Univ., Diss., 2007
|
8 |
Complexity results and practical algorithms for logics in knowledge representationTobies, Stephan. Unknown Date (has links) (PDF)
Techn. Hochsch., Diss., 2001--Aachen.
|
Page generated in 0.0856 seconds