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

A Formal Theory for the Complexity Class Associated with the Stable Marriage Problem

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

DOI10.4230/LIPIcs.CSL.2011.381zbMath1247.68095OpenAlexW2248358623MaRDI QIDQ2915696

Yuli Ye, Dai Tri Man Lê, Stephen A. Cook

Publication date: 18 September 2012

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_2d07.html


zbMATH Keywords

bounded arithmeticcomplexity theorycomparator circuits


Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)


Related Items (1)

The complexity of the comparator circuit value problem




This page was built for publication: A Formal Theory for the Complexity Class Associated with the Stable Marriage Problem

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