Upload
Featured Recent Articles Topics Login Upload

Search Results for 'poly time'

poly time published presentations and documents on DocSlides.

NP-Completeness
NP-Completeness
by myesha-ticknor
Dr. Yingwu Zhu. Chapter 34. 2. NP-Completeness. P...
The Strange Link between Incompressibility and Complexity
The Strange Link between Incompressibility and Complexity
by marina-yarberry
China Theory Week, Aarhus. August 13, 2012. Today...
P, NP, NP-Complete Problems
P, NP, NP-Complete Problems
by phoebe-click
Polynomial Problems (P Family). The set of proble...
Circuit Complexity and Derandomization
Circuit Complexity and Derandomization
by terrificycre
Tokyo Institute of Technology. Akinori. Kawachi. ...
Beating Brute Force Search for QBF
Beating Brute Force Search for QBF
by faustina-dinatale
Satisfiability. Rahul. . Santhanam. University o...
Reduction s
Reduction s
by phoebe-click
& . NP-Completeness. Jeff Edmonds. York Unive...
Water Absorption of Polymer Solutions
Water Absorption of Polymer Solutions
by luanne-stotts
Hypothesis:. If the polymer is moderately polar t...
Reduction s
Reduction s
by natalia-silvester
& . NP-Completeness. Jeff Edmonds. York Unive...
iO with Exponential Efficiency
iO with Exponential Efficiency
by cheryl-pisano
Huijia. Lin (USB), . Rafael Pass . (Cornell). Ka...
Enumerative Lattice Algorithms in any Norm via M-Ellipsoid Coverings
Enumerative Lattice Algorithms in any Norm via M-Ellipsoid Coverings
by PeacefulPanda
Daniel Dadush . (CWI). Joint with Chris . Peikert....
CS151 Complexity Theory Lecture 15
CS151 Complexity Theory Lecture 15
by oconnor
May 23, 2023. May 23, 2023. Arthur-Merlin Games. D...
Toward Constant time Enumeration by Amortized Analysis
Toward Constant time Enumeration by Amortized Analysis
by phoebe-click
27. /. Aug/. 20. 15 . Lorentz Workshop for Enume...
quantum information and convex optimization
quantum information and convex optimization
by trish-goza
Aram Harrow (MIT). Simons Institute. 25.9.2014. o...
Jeff Edmonds
Jeff Edmonds
by karlyn-bohler
York University. COSC 4111. Lecture. . 2. 4111 C...
NP-complete
NP-complete
by tatiana-dople
examples. CSCI3130 Tutorial . 10. Chun-Ho Hung. ...
1 Chapter 8
1 Chapter 8
by conchita-marotz
NP and Computational. Intractability. Slides by K...
Models of Exact Algorithms for NP-Hard Problems
Models of Exact Algorithms for NP-Hard Problems
by lois-ondreau
Rahul. . Santhanam. University of Edinburgh. Pla...
COUNTING SUBGRAPHS
COUNTING SUBGRAPHS
by calandra-battersby
Radu Curticapean, Holger Dell, Dániel Marx. NE...
C omputational Complexity Theory
C omputational Complexity Theory
by pasty-toler
Lecture 5:. . Class co-NP and EXP;. . ...
Conspiracies between Learning Algorithms,
Conspiracies between Learning Algorithms,
by mitsue-stanley
Lower Bounds, and Pseudorandomness. Igor Carboni ...
Fast Hamiltonicity Checking
Fast Hamiltonicity Checking
by aaron
via . Bases . of . Perfect Matchings. STOC 2013. ...
The diagonalization method
The diagonalization method
by ellena-manuel
The halting problem is . undecidable. Decidabilit...
Advancing Vocabulary Skills
Advancing Vocabulary Skills
by eurolsin
Chapter 10 . (Word Parts) In Context. arch, -archy...
Nets vs hierarchies
Nets vs hierarchies
by celsa-spraggs
for hard optimization problems. Aram Harrow. arXi...
Overlapping Coalition Formation: Charting
Overlapping Coalition Formation: Charting
by tatyana-admore
the Tractability Frontier. Y. . Zick. , G. . Chal...
Ties Matter:
Ties Matter:
by kittie-lecroy
Complexity of Voting Manipulation Revisited . b. ...
Non-Uniform
Non-Uniform
by tawny-fly
ACC Circuit Lower Bounds. Ryan Williams . IBM...
Non-Uniform
Non-Uniform
by test
ACC Circuit Lower Bounds. Ryan Williams . IBM...
Quantum Security for Post-Quantum Cryptography
Quantum Security for Post-Quantum Cryptography
by tawny-fly
Fang Song. IQC, University of Waterloo. -- “Qua...
Quantum de Finetti theorems for local measurements
Quantum de Finetti theorems for local measurements
by ellena-manuel
Fernando Brandão (UCL). Aram Harrow (MIT). arXiv...
Faculty Mentoring Faculty
Faculty Mentoring Faculty
by conchita-marotz
Samantha Gill. Mentoring Director. College of Agr...
On Derandomizing
On Derandomizing
by olivia-moreira
Algorithms . that Err Extremely Rarely. Oded. ....
On Derandomizing
On Derandomizing
by myesha-ticknor
Algorithms . that Err Extremely Rarely. Oded. ....
CSE 105
CSE 105
by calandra-battersby
Theory of Computation. Alexander . Tsiatas. Sprin...
Poly Hockey Official R ules
Poly Hockey Official R ules
by yoshiko-marsland
1. 2. A picture paints a thousand words. Use the ...
SIAMJ.COMPUT2010SocietyforIndustrialandAppliedMathematicsVol.39,No.7,p
SIAMJ.COMPUT2010SocietyforIndustrialandAppliedMathematicsVol.39,No.7,p
by angelina
 ODEDGOLDREICH,SHAFIGOLDWASSER,ANDASAFNUSSBOIMcod...
Non-Uniform ACC Circuit Lower Bounds
Non-Uniform ACC Circuit Lower Bounds
by natalie
Ryan Williams . IBM . Almaden. TexPoint. font...
ETH-hardness of Densest-k-
ETH-hardness of Densest-k-
by quinn
Subgraph. . with Perfect Completeness. Aviad Rubi...
Population Recovery from Corrupted Samples
Population Recovery from Corrupted Samples
by singh
. . Michael Saks, . Rutgers University. joint wor...
Approximation Schemes for a Unit-Demand Buyer with Independent Items via Symmetries
Approximation Schemes for a Unit-Demand Buyer with Independent Items via Symmetries
by wang
Pravesh Kothari, . Divyarthi Mohan,. Ariel Schvar...