Decision problem that can be verified but not run in n^2 time












2












$begingroup$


A much much weaker idea similar to the P=NP question, is there a decision problem that can be verified in $O(n^2)$ time, but it can be proven that there is no algorithm that decides it $O(n^2)$ time?






time-complexity







share|cite|improve this question











$endgroup$












  • $begingroup$
    In what model of computation?
    $endgroup$
    – Curtis F
    3 hours ago










  • $begingroup$
    @CurtisF if it matters then please write that up as an answer. I was under the impression that that sort of thing didn't matter within reason, or else how can one ask "does P=NP"?
    $endgroup$
    – while1fork
    3 hours ago






  • 3




    $begingroup$
    @while1fork. It does matter if you're giving precise timing estimates, like $O(n^2)$.
    $endgroup$
    – Rick Decker
    3 hours ago


















2












$begingroup$


A much much weaker idea similar to the P=NP question, is there a decision problem that can be verified in $O(n^2)$ time, but it can be proven that there is no algorithm that decides it $O(n^2)$ time?






time-complexity







share|cite|improve this question











$endgroup$












  • $begingroup$
    In what model of computation?
    $endgroup$
    – Curtis F
    3 hours ago










  • $begingroup$
    @CurtisF if it matters then please write that up as an answer. I was under the impression that that sort of thing didn't matter within reason, or else how can one ask "does P=NP"?
    $endgroup$
    – while1fork
    3 hours ago






  • 3




    $begingroup$
    @while1fork. It does matter if you're giving precise timing estimates, like $O(n^2)$.
    $endgroup$
    – Rick Decker
    3 hours ago
















2












2








2





$begingroup$


A much much weaker idea similar to the P=NP question, is there a decision problem that can be verified in $O(n^2)$ time, but it can be proven that there is no algorithm that decides it $O(n^2)$ time?






time-complexity







share|cite|improve this question











$endgroup$




A much much weaker idea similar to the P=NP question, is there a decision problem that can be verified in $O(n^2)$ time, but it can be proven that there is no algorithm that decides it $O(n^2)$ time?






time-complexity




time-complexity






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited 4 hours ago







while1fork

















asked 4 hours ago









while1forkwhile1fork

183




183












  • $begingroup$
    In what model of computation?
    $endgroup$
    – Curtis F
    3 hours ago










  • $begingroup$
    @CurtisF if it matters then please write that up as an answer. I was under the impression that that sort of thing didn't matter within reason, or else how can one ask "does P=NP"?
    $endgroup$
    – while1fork
    3 hours ago






  • 3




    $begingroup$
    @while1fork. It does matter if you're giving precise timing estimates, like $O(n^2)$.
    $endgroup$
    – Rick Decker
    3 hours ago




















  • $begingroup$
    In what model of computation?
    $endgroup$
    – Curtis F
    3 hours ago










  • $begingroup$
    @CurtisF if it matters then please write that up as an answer. I was under the impression that that sort of thing didn't matter within reason, or else how can one ask "does P=NP"?
    $endgroup$
    – while1fork
    3 hours ago






  • 3




    $begingroup$
    @while1fork. It does matter if you're giving precise timing estimates, like $O(n^2)$.
    $endgroup$
    – Rick Decker
    3 hours ago


















$begingroup$
In what model of computation?
$endgroup$
– Curtis F
3 hours ago




$begingroup$
In what model of computation?
$endgroup$
– Curtis F
3 hours ago












$begingroup$
@CurtisF if it matters then please write that up as an answer. I was under the impression that that sort of thing didn't matter within reason, or else how can one ask "does P=NP"?
$endgroup$
– while1fork
3 hours ago




$begingroup$
@CurtisF if it matters then please write that up as an answer. I was under the impression that that sort of thing didn't matter within reason, or else how can one ask "does P=NP"?
$endgroup$
– while1fork
3 hours ago




3




3




$begingroup$
@while1fork. It does matter if you're giving precise timing estimates, like $O(n^2)$.
$endgroup$
– Rick Decker
3 hours ago






$begingroup$
@while1fork. It does matter if you're giving precise timing estimates, like $O(n^2)$.
$endgroup$
– Rick Decker
3 hours ago












1 Answer
1






active

oldest

votes


















3












$begingroup$

The answer depends a lot on the model of computation.



On one extreme: in the decision tree model, many lower bounds can be proven. For instance, consider the 3SUM problem. You can verify an alleged solution to the 3SUM problem in $O(n)$ time, but it's conjectured that no algorithm can solve the 3SUM problem in $O(n^{2-epsilon})$ time for any $epsilon>0$. One can prove this holds in some version of the algebraic decision tree model; one can prove that any algorithm to solve it in this model must take $Omega(n^2)$ time. This provides a gap of $O(n^2)$ vs $O(n)$ for solving vs verifying solutions, if the verifier is limited to the algebraic decision tree model. This is a pretty limited result; in this case, the model means that we're restricting attention to algorithms of a particular form. So, it doesn't rule out the possibility of some other algorithm (that does something weird) being faster.



On the other extreme: if we allow arbitrary (non-uniform) boolean circuits, then there is no explicitly stated function $f$ on $n$ bits where we can currently prove that every circuit for computing $f$ needs $ge 3.1n$ gates. In other words, this is saying that we have no clue how to prove lower bounds for circuits. Roughly speaking, we have no known result of a problem where we can prove that solving it requires circuits of size $omega(n)$. See, e.g., https://cstheory.stackexchange.com/a/8005/5038 and https://cstheory.stackexchange.com/q/21400/5038. So, given our current state of knowledge, we have no hope of proving a result like that if the model of computation is unrestricted boolean circuits.






share|cite|improve this answer









$endgroup$













    Your Answer





    StackExchange.ifUsing("editor", function () {
    return StackExchange.using("mathjaxEditing", function () {
    StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
    StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
    });
    });
    }, "mathjax-editing");

    StackExchange.ready(function() {
    var channelOptions = {
    tags: "".split(" "),
    id: "419"
    };
    initTagRenderer("".split(" "), "".split(" "), channelOptions);

    StackExchange.using("externalEditor", function() {
    // Have to fire editor after snippets, if snippets enabled
    if (StackExchange.settings.snippets.snippetsEnabled) {
    StackExchange.using("snippets", function() {
    createEditor();
    });
    }
    else {
    createEditor();
    }
    });

    function createEditor() {
    StackExchange.prepareEditor({
    heartbeatType: 'answer',
    autoActivateHeartbeat: false,
    convertImagesToLinks: false,
    noModals: true,
    showLowRepImageUploadWarning: true,
    reputationToPostImages: null,
    bindNavPrevention: true,
    postfix: "",
    imageUploader: {
    brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
    contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
    allowUrls: true
    },
    onDemand: true,
    discardSelector: ".discard-answer"
    ,immediatelyShowMarkdownHelp:true
    });


    }
    });














    draft saved

    draft discarded


















    StackExchange.ready(
    function () {
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcs.stackexchange.com%2fquestions%2f104894%2fdecision-problem-that-can-be-verified-but-not-run-in-n2-time%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown

























    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    3












    $begingroup$

    The answer depends a lot on the model of computation.



    On one extreme: in the decision tree model, many lower bounds can be proven. For instance, consider the 3SUM problem. You can verify an alleged solution to the 3SUM problem in $O(n)$ time, but it's conjectured that no algorithm can solve the 3SUM problem in $O(n^{2-epsilon})$ time for any $epsilon>0$. One can prove this holds in some version of the algebraic decision tree model; one can prove that any algorithm to solve it in this model must take $Omega(n^2)$ time. This provides a gap of $O(n^2)$ vs $O(n)$ for solving vs verifying solutions, if the verifier is limited to the algebraic decision tree model. This is a pretty limited result; in this case, the model means that we're restricting attention to algorithms of a particular form. So, it doesn't rule out the possibility of some other algorithm (that does something weird) being faster.



    On the other extreme: if we allow arbitrary (non-uniform) boolean circuits, then there is no explicitly stated function $f$ on $n$ bits where we can currently prove that every circuit for computing $f$ needs $ge 3.1n$ gates. In other words, this is saying that we have no clue how to prove lower bounds for circuits. Roughly speaking, we have no known result of a problem where we can prove that solving it requires circuits of size $omega(n)$. See, e.g., https://cstheory.stackexchange.com/a/8005/5038 and https://cstheory.stackexchange.com/q/21400/5038. So, given our current state of knowledge, we have no hope of proving a result like that if the model of computation is unrestricted boolean circuits.






    share|cite|improve this answer









    $endgroup$


















      3












      $begingroup$

      The answer depends a lot on the model of computation.



      On one extreme: in the decision tree model, many lower bounds can be proven. For instance, consider the 3SUM problem. You can verify an alleged solution to the 3SUM problem in $O(n)$ time, but it's conjectured that no algorithm can solve the 3SUM problem in $O(n^{2-epsilon})$ time for any $epsilon>0$. One can prove this holds in some version of the algebraic decision tree model; one can prove that any algorithm to solve it in this model must take $Omega(n^2)$ time. This provides a gap of $O(n^2)$ vs $O(n)$ for solving vs verifying solutions, if the verifier is limited to the algebraic decision tree model. This is a pretty limited result; in this case, the model means that we're restricting attention to algorithms of a particular form. So, it doesn't rule out the possibility of some other algorithm (that does something weird) being faster.



      On the other extreme: if we allow arbitrary (non-uniform) boolean circuits, then there is no explicitly stated function $f$ on $n$ bits where we can currently prove that every circuit for computing $f$ needs $ge 3.1n$ gates. In other words, this is saying that we have no clue how to prove lower bounds for circuits. Roughly speaking, we have no known result of a problem where we can prove that solving it requires circuits of size $omega(n)$. See, e.g., https://cstheory.stackexchange.com/a/8005/5038 and https://cstheory.stackexchange.com/q/21400/5038. So, given our current state of knowledge, we have no hope of proving a result like that if the model of computation is unrestricted boolean circuits.






      share|cite|improve this answer









      $endgroup$
















        3












        3








        3





        $begingroup$

        The answer depends a lot on the model of computation.



        On one extreme: in the decision tree model, many lower bounds can be proven. For instance, consider the 3SUM problem. You can verify an alleged solution to the 3SUM problem in $O(n)$ time, but it's conjectured that no algorithm can solve the 3SUM problem in $O(n^{2-epsilon})$ time for any $epsilon>0$. One can prove this holds in some version of the algebraic decision tree model; one can prove that any algorithm to solve it in this model must take $Omega(n^2)$ time. This provides a gap of $O(n^2)$ vs $O(n)$ for solving vs verifying solutions, if the verifier is limited to the algebraic decision tree model. This is a pretty limited result; in this case, the model means that we're restricting attention to algorithms of a particular form. So, it doesn't rule out the possibility of some other algorithm (that does something weird) being faster.



        On the other extreme: if we allow arbitrary (non-uniform) boolean circuits, then there is no explicitly stated function $f$ on $n$ bits where we can currently prove that every circuit for computing $f$ needs $ge 3.1n$ gates. In other words, this is saying that we have no clue how to prove lower bounds for circuits. Roughly speaking, we have no known result of a problem where we can prove that solving it requires circuits of size $omega(n)$. See, e.g., https://cstheory.stackexchange.com/a/8005/5038 and https://cstheory.stackexchange.com/q/21400/5038. So, given our current state of knowledge, we have no hope of proving a result like that if the model of computation is unrestricted boolean circuits.






        share|cite|improve this answer









        $endgroup$



        The answer depends a lot on the model of computation.



        On one extreme: in the decision tree model, many lower bounds can be proven. For instance, consider the 3SUM problem. You can verify an alleged solution to the 3SUM problem in $O(n)$ time, but it's conjectured that no algorithm can solve the 3SUM problem in $O(n^{2-epsilon})$ time for any $epsilon>0$. One can prove this holds in some version of the algebraic decision tree model; one can prove that any algorithm to solve it in this model must take $Omega(n^2)$ time. This provides a gap of $O(n^2)$ vs $O(n)$ for solving vs verifying solutions, if the verifier is limited to the algebraic decision tree model. This is a pretty limited result; in this case, the model means that we're restricting attention to algorithms of a particular form. So, it doesn't rule out the possibility of some other algorithm (that does something weird) being faster.



        On the other extreme: if we allow arbitrary (non-uniform) boolean circuits, then there is no explicitly stated function $f$ on $n$ bits where we can currently prove that every circuit for computing $f$ needs $ge 3.1n$ gates. In other words, this is saying that we have no clue how to prove lower bounds for circuits. Roughly speaking, we have no known result of a problem where we can prove that solving it requires circuits of size $omega(n)$. See, e.g., https://cstheory.stackexchange.com/a/8005/5038 and https://cstheory.stackexchange.com/q/21400/5038. So, given our current state of knowledge, we have no hope of proving a result like that if the model of computation is unrestricted boolean circuits.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered 2 hours ago









        D.W.♦D.W.

        99.8k12121286




        99.8k12121286






























            draft saved

            draft discarded




















































            Thanks for contributing an answer to Computer Science Stack Exchange!


            • Please be sure to answer the question. Provide details and share your research!

            But avoid …



            • Asking for help, clarification, or responding to other answers.

            • Making statements based on opinion; back them up with references or personal experience.


            Use MathJax to format equations. MathJax reference.


            To learn more, see our tips on writing great answers.




            draft saved


            draft discarded














            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcs.stackexchange.com%2fquestions%2f104894%2fdecision-problem-that-can-be-verified-but-not-run-in-n2-time%23new-answer', 'question_page');
            }
            );

            Post as a guest















            Required, but never shown





















































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown

































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown







            -

            Popular posts from this blog

            What other Star Trek series did the main TNG cast show up in?

            Image
            .everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty{ margin-bottom:0; } 4 I'm referring to Picard, Riker, Data, Worf, Geordi, Dr. Crusher, Wesley Crusher, Chief O'Brien and family, Deanna Troi, Guinan. I know Picard and Worf show up on DS9, though I haven't seen it myself. I'm curious what happened to the characters after that last episode of TNG? star-trek star-trek-tng share | improve this question edited 10 hours ago Ham Sandwich 6,051 2 25 75 ...
            Read more

            Berlina muro

            Image
            La berlina muro ĉe Bethaniendamm, 1986 La berlina muro aŭ simple la muro [1] , nomita ankaŭ "kontraŭfaŝisma remparo" en propaganda lingvo de la iama Germana Demokratia Respubliko, estis parto de la interngermana limo, kiu dividis de la 13-a de aŭgusto 1961 ĝis la 9-a de novembro 1989 okcidentan Berlinon de la orienta parto de la urbo kaj de la ĉirkaŭa tereno de la GDR. Ĝi estis unu el la plej famaj simboloj de la malvarma milito kaj de la disdivido de Germanio. Pli ol simpla muro, la berlina muro estis fakte tuta defendokonstruaĵo kun du muroj, ena malplena strio, rondirvojo, gardturoj kaj alarmsistemoj. Dum la provo transiri la severe garditan limon al okcidenta Berlino multaj homoj estis mortigitaj. La preciza nombro de viktimoj estas pridisputita kaj ne certa; la nombroj anoncataj varias inter 86 kaj 238 mortintoj. La malplifortiĝo de Sovetunio kaj la politiko de liberigo gvidita de Miĥail Gorbaĉov ebligis al la orientgermanoj faligi la 9-an de novembro 1989 l...
            Read more

            Berlina aerponto

            Image
            Flugkoridoroj dum la blokado de Berlino La Berlina aerponto estas la provizigo de okcidenta Berlino per aviadiloj fare de la aliancanoj inter la 23-a de junio 1948 kaj la 12-a de majo 1949 dum la blokado de Berlino fare de la sovetia armeo. Enhavo 1 Historio 1.1 La aerkoridoroj 1.2 Unuaj flugoj 1.3 Plibonigo de la aerponto 1.4 Fino de la aerponto 1.5 Rozinbombiloj 1.6 Bilanco 2 Flughavenoj 2.1 Berlino 2.2 Okcidenta Germanio 3 Aviadiloj de la berlina aerponto 4 15-a datreveno de la aerponto 5 Bibliografio 6 Referencoj 7 Eksteraj ligiloj Historio | General Lucius D. Clay, militguberniestro de la usona okupadzono Jam antaŭ la berlina aerponto estiĝis la malgranda aerponto . La estro de la sovetia militadministracio en Germanio, Vasili Daniloviĉ Sokolovski, ordonis la 1-an de aprilo 1948, kiel reago al la konferenco de Londono inter britoj, francoj kaj reprezentantoj de Benelukso pri aligo de Germa...
            Read more