skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


Title: Operations Management in the Age of the Sharing Economy: What Is Old and What Is New?
Award ID(s):
1831140
PAR ID:
10187211
Author(s) / Creator(s):
;
Date Published:
Journal Name:
Manufacturing and service operations management
Volume:
22
Issue:
1
ISSN:
2616-3349
Page Range / eLocation ID:
1
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; (, Annual Symposium on Foundations of Computer Science)
    We prove that deciding the vanishing of the character of the symmetric group is C=P-complete. We use this hardness result to prove that the square of the character is not contained in #P, unless the polynomial hierarchy collapses to the second level. This rules out the existence of any (unsigned) combinatorial description for the square of the characters. As a byproduct of our proof we conclude that deciding positivity of the character is PP-complete under many-one reductions, and hence PH-hard under Turing-reductions. 
    more » « less
  2. (, Notices of the American Mathematical Society)
  3. ; ; (, Notices of the American Mathematical Society)
  4. ; ; ; ; ; (, Annals of the New York Academy of Sciences)
  5. ; ; ; (, The Web Conference (WWW))
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email