• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 946,626
Next 10 →

The Analytic Polynomial-Time Hierarchy

by Herbert Baier, Klaus W. Wagner - Mathematical Logic Quaterly , 1997
"... Motivated by results on interactive proof systems we investigate an 9-8-hierarchy over P using word quantifiers as well as two types of set quantifiers. This hierarchy, which extends the (arithmetic) polynomial-time hierarchy, is called the analytic polynomial-time hierarchy. It is shown that every ..."
Abstract - Cited by 3 (2 self) - Add to MetaCart
Motivated by results on interactive proof systems we investigate an 9-8-hierarchy over P using word quantifiers as well as two types of set quantifiers. This hierarchy, which extends the (arithmetic) polynomial-time hierarchy, is called the analytic polynomial-time hierarchy. It is shown

Hierarchies from Fluxes in String Compactifications

by Steven B. Giddings, Shamit Kachru, Joseph Polchinski , 2002
"... Warped compactifications with significant warping provide one of the few known mechanisms for naturally generating large hierarchies of physical scales. We demonstrate that this mechanism is realizable in string theory, and give examples involving orientifold compactifications of IIB string theory a ..."
Abstract - Cited by 724 (33 self) - Add to MetaCart
Warped compactifications with significant warping provide one of the few known mechanisms for naturally generating large hierarchies of physical scales. We demonstrate that this mechanism is realizable in string theory, and give examples involving orientifold compactifications of IIB string theory

Electronic Markets and Electronic Hierarchies

by Robert I. Benjamin, Thomas W. Malone, Joanne Yates - Communications of the ACM , 1987
"... This paper analyzes the fundamental changes in market structures that may result from the increasing use of information technology. First, an analytic framework is presented and its usefulness is demonstrated in explaining several major historical changes in American business structures. Then, the f ..."
Abstract - Cited by 684 (11 self) - Add to MetaCart
, the framework is used to help explain how electronic markets and electronic hierarchies will allow closer integration of adjacent steps in the value added chains of our economy. The most surprising prediction is that information technology will lead to an overall shift toward proportionately more coordination

PP IS AS HARD AS THE POLYNOMIAL-TIME HIERARCHY*

by Seinosuke Today
"... Abstract. In this paper, two interesting complexity classes, PP and P, are compared with PH, the polynomial-time hierarchy. It is shown that every set in PH is polynomial-time Turing reducible to a set in PP, and PH is included in BP. 0)P. As a consequence of the results, it follows thatPPPH (or 03P ..."
Abstract - Add to MetaCart
P__ _ PH) implies a collapse of PH. A stronger result is also shown: every set in PP(PH) is polynomial-time Turing reducible to a set in PP. Key words, polynomial-time hierarchy, probabilistic Turing machine, polynomial-time Turing reductions, parity, randomized reduction

Polynomial-Time Hierarchy on Randomized Machines

by Time-space Lower Bounds For The
"... 1 Introduction Proving lower bounds remains one of the most challenging tasks in computationalcomplexity. Satisfiability, the seminal NP-complete problem, is particularly unyielding in this respect. While we believe that any algorithm for satisfiabilitytakes time linear exponential in the number of ..."
Abstract - Add to MetaCart
of variables in the formula, we have been unable to prove super-linear time lower bounds on random access machinesdespite several decades of effort. Additionally, problems complete for higher levels of the polynomial-time hierarchy, while not receiving as much attention, havealso resisted nontrivial time lower

Polynomial time approximation schemes for Euclidean TSP and other geometric problems

by Sanjeev Arora - In Proceedings of the 37th IEEE Symposium on Foundations of Computer Science (FOCS’96 , 1996
"... Abstract. We present a polynomial time approximation scheme for Euclidean TSP in fixed dimensions. For every fixed c � 1 and given any n nodes in � 2, a randomized version of the scheme finds a (1 � 1/c)-approximation to the optimum traveling salesman tour in O(n(log n) O(c) ) time. When the nodes a ..."
Abstract - Cited by 399 (3 self) - Add to MetaCart
Abstract. We present a polynomial time approximation scheme for Euclidean TSP in fixed dimensions. For every fixed c � 1 and given any n nodes in � 2, a randomized version of the scheme finds a (1 � 1/c)-approximation to the optimum traveling salesman tour in O(n(log n) O(c) ) time. When the nodes

A Robot Exploration and Mapping Strategy Based on a Semantic Hierarchy of Spatial Representations

by Benjamin Kuipers, Yung-Tai Byun - JOURNAL OF ROBOTICS AND AUTONOMOUS SYSTEMS , 1991
"... ..."
Abstract - Cited by 467 (27 self) - Add to MetaCart
Abstract not found

Algorithms for Quantum Computation: Discrete Logarithms and Factoring

by Peter W. Shor , 1994
"... A computer is generally considered to be a universal computational device; i.e., it is believed able to simulate any physical computational device with a increase in computation time of at most a polynomial factor. It is not clear whether this is still true when quantum mechanics is taken into consi ..."
Abstract - Cited by 1103 (7 self) - Add to MetaCart
A computer is generally considered to be a universal computational device; i.e., it is believed able to simulate any physical computational device with a increase in computation time of at most a polynomial factor. It is not clear whether this is still true when quantum mechanics is taken

Simulating Physics with Computers

by Richard Feynman, Peter W. Shor - SIAM Journal on Computing , 1982
"... A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time of at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration. ..."
Abstract - Cited by 601 (1 self) - Add to MetaCart
A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time of at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration

Kodaira-Spencer theory of gravity and exact results for quantum string amplitudes

by M. Bershadsky, S. Cecotti, H. Ooguri, C. Vafa - Commun. Math. Phys , 1994
"... We develop techniques to compute higher loop string amplitudes for twisted N = 2 theories with ĉ = 3 (i.e. the critical case). An important ingredient is the discovery of an anomaly at every genus in decoupling of BRST trivial states, captured to all orders by a master anomaly equation. In a particu ..."
Abstract - Cited by 545 (60 self) - Add to MetaCart
We develop techniques to compute higher loop string amplitudes for twisted N = 2 theories with ĉ = 3 (i.e. the critical case). An important ingredient is the discovery of an anomaly at every genus in decoupling of BRST trivial states, captured to all orders by a master anomaly equation. In a
Next 10 →
Results 1 - 10 of 946,626
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2018 The Pennsylvania State University