Search Results - "Theory of computing (Chicago, Ill.)"

Refine Results
  1. 1
    An algorithmic framework for colouring locally sparse graphs

    An algorithmic framework for colouring locally sparse graphs by Davies, Ewan, Kang, Ross, Pirot, François, Sereni, Jean-Sébastien

    Get full text
    Article
    Save to List
    Saved in:
  2. 2
    Verifier-on-a-Leash: New Schemes for Verifiable Delegated Quantum Computation, with Quasilinear Resources

    Verifier-on-a-Leash: New Schemes for Verifiable Delegated Quantum Computation, with Quasilinear Resources by Coladangelo, Andrea, Grilo, Alex, Jeffery, Stacey, Vidick, Thomas

    Get full text
    Article
    Save to List
    Saved in:
  3. 3
    Monotone Circuit Lower Bounds from Resolution

    Monotone Circuit Lower Bounds from Resolution by Garg, Ankit, Göös, Mika, Kamath, Pritish, Sokolov, Dmitry

    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    Linear-Time Algorithm for Quantum 2SAT

    Linear-Time Algorithm for Quantum 2SAT by Arad, Itai, Santha, Miklos, Sundaram, Aarthi, Zhang, Shengyu

    Get full text
    Article
    Save to List
    Saved in:
  5. 5
    Tensor network complexity of multilinear maps

    Tensor network complexity of multilinear maps by Austrin, Per, Kaski, Petteri, Kubjas, Kaie

    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    On some extensions of the FKN theorem

    On some extensions of the FKN theorem by Jendrej, Jacek, Oleszkiewicz, Krzysztof, Wojtaszczyk, Jakub

    Get full text
    Items that cite this one
    Article
    Save to List
    Saved in:
  7. 7
    On the Size of Homogeneous and of Depth-Four Formulas with Low Individual Degree

    On the Size of Homogeneous and of Depth-Four Formulas with Low Individual Degree by Kayal, Neeraj, Saha, Chandan, Tavenas, Sébastien

    Get full text
    Items that cite this one
    Article
    Save to List
    Saved in:
  8. 8
    On the NP-hardness of approximating ordering-constraint satisfaction problems

    On the NP-hardness of approximating ordering-constraint satisfaction problems by Austrin, Per, Manokaran, Rajsekar, Wenner, Cenny

    Get full text
    Items that cite this one
    Article
    Save to List
    Saved in:
  9. 9
    Improved inapproximability for TSP

    Improved inapproximability for TSP by Lampis, Michail

    Get full text
    Items that cite this one
    Article
    Save to List
    Saved in:
  10. 10
    On the Hardness of Approximating Balanced Homogeneous 3-Lin

    On the Hardness of Approximating Balanced Homogeneous 3-Lin by Håstad, Johan, Manokaran, Rajsekar

    Get full text
    Article
    Save to List
    Saved in:
  11. 11
    Approximation resistance on satisfiable instances for predicates with few accepting inputs

    Approximation resistance on satisfiable instances for predicates with few accepting inputs by Huang, Sangxia

    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    Improved NP-Inapproximability for 2-Variable Linear Equations

    Improved NP-Inapproximability for 2-Variable Linear Equations by Håstad, Johan, Huang, Sangxia, Manokaran, Rajsekar, O'Donnell, Ryan, Wright, John

    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    Towards an optimal separation of space and lenght in resolution

    Towards an optimal separation of space and lenght in resolution by Nordström, Jakob, Håstad, Johan

    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    Circumventing d-to-1 for Approximation Resistance of Satisfiable Predicates Strictly Containing Parity of Width at Least Four

    Circumventing d-to-1 for Approximation Resistance of Satisfiable Predicates Strictly Containing Parity of Width at Least Four by Wenner, Cenny

    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    Inapproximability of vertex cover and independent set in bounded degree graphs

    Inapproximability of vertex cover and independent set in bounded degree graphs by Austrin, Per, Khot, Subhash, Safra, Muli

    Get full text
    Items that cite this one
    Article
    Save to List
    Saved in:
  16. 16
    Tensor-based Hardness of the Shortest Vector Problem to within Almost Polynomial Factors

    Tensor-based Hardness of the Shortest Vector Problem to within Almost Polynomial Factors by Haviv, Ishay, Regev, Oded

    Get full text
    Items that cite this one
    Article
    Save to List
    Saved in:
  17. 17
    Query efficient PCPs with perfect completeness

    Query efficient PCPs with perfect completeness by Håstad, Johan, Khot, Subhash

    Get full text
    Items that cite this one
    Article
    Save to List
    Saved in:
  18. 18
    The randomized communicatin complexity of set disjointness

    The randomized communicatin complexity of set disjointness by Håstad, Johan, Wigderson, Avi

    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    On-line routing of virtual circuits with applications to load balancing and machine scheduling

    On-line routing of virtual circuits with applications to load balancing and machine scheduling by Aspnes, James, Azar, Yossi, Fiat, Amos, Plotkin, Serge, Waarts, Orli

    Published in Journal of the ACM
    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  20. 20
    Eavesdropping games: a graph-theoretic approach to privacy in distributed systems

    Eavesdropping games: a graph-theoretic approach to privacy in distributed systems by FRANKLIN, MATTHEW, GALIL, ZVI, YUNG, MOTI

    Published in Journal of the ACM
    Get full text
    Items that this one cites
    Article
    Save to List
    Saved in:

Search Tools: