Trudy Matematicheskogo Instituta imeni V.A. Steklova
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Forthcoming papers
Archive
Impact factor
Guidelines for authors
License agreement

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Trudy Mat. Inst. Steklova:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Trudy Matematicheskogo Instituta imeni V.A. Steklova, 2003, Volume 242, Pages 23–43 (Mi tm403)  

This article is cited in 23 scientific papers (total in 23 papers)

Lower Bounds for Polynomial Calculus: Nonbinomial Case

M. V. Alekhnovicha, A. A. Razborovb

a M. V. Lomonosov Moscow State University
b Steklov Mathematical Institute, Russian Academy of Sciences
References:
Abstract: We generalize recent linear lower bounds for Polynomial Calculus based on binomial ideals. We produce a general hardness criterion (that we call immunity), which is satisfied by a random function, and prove linear lower bounds on the degree of PC refutations for a wide class of tautologies based on immune functions. As applications of our techniques, we introduce mod$_p$. Tseitin tautologies in the Boolean case (e.g. in the presence of axioms $x_i^2=x_i$), prove that they are hard for PC over fields with characteristic different from $p$, and generalize them to the flow tautologies that are based on the majority function and are proved to be hard over any field. We also prove the $\Omega(n)$ lower bound for random $k$-CNFs over fields of characteristic 2.
Received in October 2002
Bibliographic databases:
Document Type: Article
UDC: 510.6
Language: Russian
Citation: M. V. Alekhnovich, A. A. Razborov, “Lower Bounds for Polynomial Calculus: Nonbinomial Case”, Mathematical logic and algebra, Collected papers. Dedicated to the 100th birthday of academician Petr Sergeevich Novikov, Trudy Mat. Inst. Steklova, 242, Nauka, MAIK «Nauka/Inteperiodika», M., 2003, 23–43; Proc. Steklov Inst. Math., 242 (2003), 18–35
Citation in format AMSBIB
\Bibitem{AleRaz03}
\by M.~V.~Alekhnovich, A.~A.~Razborov
\paper Lower Bounds for Polynomial Calculus: Nonbinomial Case
\inbook Mathematical logic and algebra
\bookinfo Collected papers. Dedicated to the 100th birthday of academician Petr Sergeevich Novikov
\serial Trudy Mat. Inst. Steklova
\yr 2003
\vol 242
\pages 23--43
\publ Nauka, MAIK «Nauka/Inteperiodika»
\publaddr M.
\mathnet{http://mi.mathnet.ru/tm403}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2054483}
\zmath{https://zbmath.org/?q=an:1079.03047}
\transl
\jour Proc. Steklov Inst. Math.
\yr 2003
\vol 242
\pages 18--35
Linking options:
  • https://www.mathnet.ru/eng/tm403
  • https://www.mathnet.ru/eng/tm/v242/p23
  • This publication is cited in the following 23 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Òðóäû Ìàòåìàòè÷åñêîãî èíñòèòóòà èìåíè Â. À. Ñòåêëîâà Proceedings of the Steklov Institute of Mathematics
    Statistics & downloads:
    Abstract page:577
    Full-text PDF :157
    References:48
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024