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

Komplexität von Entscheidungsproblemen. Ein Seminar

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

zbMath0327.00013MaRDI QIDQ1226083

No author found.

Publication date: 1976

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



Mathematics Subject Classification ID

Decision theory (91B06) Conference proceedings and collections of articles (00Bxx) Statistical decision theory (62Cxx)


Related Items (8)

The complexity of the word problem for abelian l-groups ⋮ A Bound on Solutions of Linear Integer Equalities and Inequalities ⋮ Dominoes and the complexity of subclasses of logical theories ⋮ Size-depth tradeoff in non-monotone Boolean formulae ⋮ On genuinely time bounded computations ⋮ On time hierarchies ⋮ The equivalence of Horn and network complexity for Boolean functions ⋮ A decision algorithm for linear sentences on a PFM




This page was built for publication: Komplexität von Entscheidungsproblemen. Ein Seminar

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