BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Date iCal//NONSGML kigkonsult.se iCalcreator 2.20.4//
METHOD:PUBLISH
X-WR-CALNAME;VALUE=TEXT:ÌÇÐÄÔ­´´
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:STANDARD
DTSTART:20231105T020000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20230312T020000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
RDATE:20240310T020000
TZNAME:EDT
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:calendar.491861.field_event_date.0@www.wright.edu
DTSTAMP:20260219T192140Z
CREATED:20230823T153337Z
DESCRIPTION:Physics Seminar: Computational Complexity and Quantum Algorithm
 sDr. Larry Merkle\, AFITAbstract: Computational complexity studies the com
 putational resources (e.g.\, time and space) required to solve decision pr
 oblems in relation to the size of the problem instance. Perhaps the best-k
 nown complexity classes are P and NP\, which include those problems that c
 an be solved in polynomial time by Turing machines of the deterministic an
 d nondeterministic varieties\, respectively. Assuming these classes are di
 stinct\, as all evidence suggests\, would imply that for many problems of 
 practical importance\, the time requirements for the best classical algori
 thms available grow exponentially as a function of instance size. However\
 , there is reason to believe that at least some such problems may be amena
 ble to polynomial-time quantum algorithms.When: Sept. 15\, 2023Time: 2:30 
 PM to 4:00 PMWhere: 112 Oelman Hall 
DTSTART;TZID=America/New_York:20230915T143000
DTEND;TZID=America/New_York:20230915T160000
LAST-MODIFIED:20230823T193036Z
LOCATION:112 Oelman Hall
SUMMARY:Physics Seminar: Computational Complexity and Quantum Algorithms
URL;TYPE=URI:/events/physics-seminar-computational-co
 mplexity-quantum-algorithms
END:VEVENT
END:VCALENDAR