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:3975148
Jump to:navigation, search

zbMath0755.68067MaRDI QIDQ3975148

Hemaspaandra, Lane A., Dirk Siefkes, Albrecht Hoene

Publication date: 26 June 1992


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

zbMATH Keywords

monotonicity\(P\)-bi-splinter\(SAT\)splinter functions


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Applications of computability and recursion theory (03D80)


Related Items (2)

On the complexity of ranking ⋮ On sets polynomially enumerable by iteration




This page was built for publication:

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