Ashish V. Naik, Kenneth W. Regan, D. Sivakumar  Home/Search
Context Related
| ibm.com/cs/people/siva/papers...qlin.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ibm.com/cs/people/siva/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper furthers the study of quasilinear time complexity initiated by Schnorr and Gurevich and Shelah. We show that the fundamental properties of the polynomial-time hierarchy carry over to the quasilinear-time hierarchy. (Update)
Context of citations to this paper: More
.... notion of speedup and work load, we would need reducibilities that are based on a linear or quasilinear growth of the output length [30, 46, 56]. We remark here that nearly all results obtained in this paper rely heavily on this freedom for polynomial growth. A very different...
...does not mirror the polynomial time hierarchy as neatly as does LTH . The quasilinear time hierarchy of Naik, Regan and Sivakumar [45] differs from SBH (QL) by allowing larger quantifiers and mimics LTH more closely. Results of Gradel and McColm, showing that a...
Cited by: More
Sharply Bounded Alternation within P - Bloch (1995) (Correct)
Persistent Computations - Kosub (1998) (Correct)
Sharply Bounded Alternation and Quasilinear Time - Bloch, Buss, Goldsmith (1997) (Correct)
Similar documents (at the sentence level):
15.6%: Quasilinear Time Complexity Theory - Naik, Regan, Sivakumar (1993) (Correct)
Active bibliography (related documents): More All
7.3: On Quasilinear Time Complexity Theory - Naik, Regan, Sivakumar (1994) (Correct)
0.5: Efficient Reductions from NP to Parity using Error-Correcting Codes - Regan (1993) (Correct)
0.5: P-Selective Sets, and Reducing Search to Decision.. - Hemaspaandra.. (1994) (Correct)
Similar documents based on text: More All
0.4: Nonlinear Interaction of Nonconcentric Spherical Sound.. - Sakov Presented By (Correct)
0.3: Averaging Theorem For Quasilinear Hamiltonian PDEs In Arbitrary.. - Bambusi (2002) (Correct)
0.3: Time-Space Tradeoffs for Satisfiability - Fortnow (1997) (Correct)
Related documents from co-citation: More All
5: Fixed-parameter tractability and Completeness I: Basic Results - Downey, Fellows - 1995
4: Satisfiability is quasilinear complete in NQL (context) - Schnorr - 1978
3: Nondeterminism within P (context) - Buss, Goldsmith - 1993
BibTeX entry: (Update)
A. Naik, K. Regan, and D. Sivakumar, Quasilinear time complexity theory, Proc. 11th STACS, Lecture Notes in Computer Science 778 (1994) 289--300. http://citeseer.ist.psu.edu/naik94quasilinear.html More
@article{ naik95quasilineartime,
author = "Ashish V. Naik and Kenneth W. Regan and D. Sivakumar",
title = "On quasilinear-time complexity theory",
journal = "Theoretical Computer Science",
volume = "148",
number = "2",
pages = "325--349",
year = "1995",
url = "citeseer.ist.psu.edu/naik94quasilinear.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
1911 Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
1450 The Design and Analysis of Computer Algorithms (context) - Aho, Hopcroft et al. - 1974
860 The Theory of Error-Correcting Codes (context) - MacWilliams, Sloane - 1977
660 An Introduction to Kolmogorov Complexity and its Application.. - Li, Vit'anyi - 1993
358 Universal classes of hash functions (context) - Carter, Wegman - 1979
168 A taxonomy of problems with fast parallel algorithms (context) - Cook - 1985
163 NP is as easy as detecting unique solutions (context) - Valiant, Vazirani - 1986
155 Checking computations in polylogarithmic time - Babai, Fortnow et al. - 1991
151 The complexity of optimization problems (context) - Krentel - 1988
138 Small-bias probability spaces: efficient constructions and a.. - Naor, Naor - 1993
138 Small-bias probability spaces: efficient constructions and a.. - Naor, Naor - 1990
126 PP is as hard as the polynomial-time hierarchy (context) - Toda - 1991
126 On isomorphisms and density of NP and other complete sets (context) - Berman, Hartmanis - 1977
88 Concatenated Codes (context) - Forney - 1966
75 Some connections between bounded query classes and nonunifor.. - Amir, Beigel et al. - 1990
73 and the behavior of polynomial time reducibilities on NP (context) - Selman, tally - 1979
71 The quantitative structure of exponential time - Lutz - 1993
69 The polynomial time hierarchy (context) - Stockmeyer - 1977
68 Bounded queries to SAT and the Boolean hierarchy - Beigel - 1991
61 A taxonomy of complexity classes of functions - Selman - 1994
61 Relations among complexity measures (context) - Pippenger, Fischer - 1979
60 Query-limited reducibilities - Beigel - 1987
58 Construction of asymptotically good low-rate error-correctin.. (context) - Alon, Bruck et al. - 1992
51 Nondeterminism within P (context) - Buss, Goldsmith - 1993
45 Two remarks on the power of counting (context) - Papadimitriou, Zachos - 1983
44 Relativized circuit complexity (context) - Wilson - 1985
43 Complete sets and the polynomial-time hierarchy (context) - Wrathall - 1977
42 Time bounded random access machines (context) - Cook, Reckhow - 1973
42 The complexity and distribution of hard problems - Juedes, Lutz - 1993
41 A structural theorem that depends quantitatively on the comp.. (context) - Beigel - 1987
40 Probabilistic algorithms in finite fields - Rabin - 1980
39 Efficient checking of polynomials and proofs and the hardnes.. - Sudan - 1992
35 New algorithms for finding irreducible polynomials over fini.. - Shoup - 1988
35 On truth-table reducibility to SAT - Buss, Hay - 1991
32 Refining nondeterminism in relativized polynomialtime bounde.. (context) - Kintala, Fischer - 1980
31 Relativization of questions about log-space computability (context) - Ladner, Lynch - 1976
29 the theory of averagecase complexity - Ben-David, Chor et al. - 1989
29 Approximable sets - Beigel, Kummer et al. - 1994
28 Computational Complexity (context) - Wagner, Wechsung - 1986
27 On helping by robust oracle machines (context) - Ko - 1987
27 Classes of bounded nondeterminism (context) - 'iaz, Tor'an - 1990
23 Quasipolynomial size circuit classes (context) - Barrington - 1992
23 Downward separation fails catastrophically for limited nonde.. - Beigel, Goldsmith - 1994
21 Languages that are easier than their proofs - Beigel, Bellare et al. - 1991
20 and verbose sets (context) - Beigel, Gasarch et al. - 1993
20 and reducing search to decision vs (context) - Naik, Ogiwara et al. - 1993
20 Nearly-linear time (context) - Gurevich, Shelah - 1989
19 Some observations on the probabilistic algorithms and NP-har.. (context) - Ko - 1982
19 Some comments on functional self-reducibility and the NP hie.. (context) - Borodin, Demers - 1976
18 Structural Complexity Theory (context) - Balc'azar, D'iaz et al. - 1988
18 Polynomial terse sets (context) - Amir, Gasarch - 1988
18 Natural self-reducible sets (context) - Selman - 1988
17 Satisfiability is quasilinear complete in NQL (context) - Schnorr - 1978
17 Randomness-optimal unique element isolation (context) - Chari, Rohatgi et al. - 1993
17 Machine models and simulations (context) - Boas - 1990
17 Bounded query classes and the difference hierarchy - Beigel, Gasarch et al. - 1989
16 Rudimentary predicates and relative computation (context) - Wrathall - 1978
14 Self-reducibility: the effects of internal structure on comp.. (context) - Joseph, Young - 1990
13 A Justesen construction of binary concatenated codes than as.. (context) - Shen - 1993
12 Robust algorithms: a different approach to oracles (context) - Schoning - 1985
12 Power indices and easier hard problems (context) - Stearns - 1990
9 Fast decoding of codes from algebraic plane curves (context) - Justesen, Larsen et al. - 1992
9 Self-reducibility structures and solutions of NP problems (context) - Balc'azar - 1990
8 the notion of linear-time computability (context) - Graedel - 1990
7 and sorting by query-bounded machines (context) - Hoene, Nickelsen et al. - 1993
6 Two--way simulation of multitape Turing machines (context) - Hennie, Stearns - 1966
5 volume 58 of Mathematics and Its Applications (context) - Tsfasman, Vladut - 1991
4 Absolute results concerning one-way functions and their appl.. (context) - Homer, Wang - 1989
4 On isolating an odd number of elements and its applications .. (context) - Gupta - 1993
4 the complexity of the satisfiability problem and the structu.. (context) - Stearns, On - 1986
3 Efficient exponentiation in finite fields (context) - Gathen - 1991
3 reduction from RAM computations to satisfiability (context) - Robson, log - 1991
2 Randomness as a Computational Resource: Issues in Efficient .. (context) - Chari
2 Bounded oracles and complexity classes inside linear space (context) - Tretkoff - 1986
2 Linear time transformations between combinatorial problems (context) - Dewdney - 1982
2 Three results on polynomial-time isomorphism of NP-complete .. (context) - Goldsmith, Joseph - 1986
2 Relativized isomorphisms of NP-completeness (context) - Goldsmith, Joseph - 1993
2 The quasilinear isomorphism challenge (context) - Regan, Wang - 1994
2 Fast Turing reductions of combinatorial problems and their a.. (context) - Dewdney - 1989
1 Fast Turing reductions between problems in NP (context) - Dewdney
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.almaden.ibm.com/cs/people/siva/papers.html): More
Roundness Estimation Via Random Sampling - Kumar, Sivakumar (1999) (Correct)
Proofs, Codes, and Polynomial-Time Reducibilities - Kumar, Sivakumar (Correct)
Constant Depth Circuits and the Lutz Hypothesis - Cai, Sivakumar, Strauss (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC