Stack Exchange Network

Stack Exchange network consists of 181 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.

Visit Stack Exchange
Loading…
    • Tour Start here for a quick overview of the site
    • Help Center Detailed answers to any questions you might have
    • Meta Discuss the workings and policies of this site
    • About Us Learn more about Stack Overflow the company
    • Business Learn more about our products
  1. current community

    • Computer Science
      help chat
    • Computer Science Meta

    your communities

    Sign up or log in to customize your list.

    more stack exchange communities

    company blog
  2. Log in
  3. Sign up
Computer Science
  1. Home
    1. Public
    2. Questions
    3. Tags
    4. Users
    5. Companies
    6. Unanswered
    1. Teams
      Stack Overflow for Teams – Start collaborating and sharing organizational knowledge. Create a free Team Why Teams?
    2. Teams
    3. Create free Team

Teams

Q&A for work

Connect and share knowledge within a single location that is structured and easy to search.

Learn more about Teams
user avatar
user avatar
user avatar
Narek Bojikian
  • Member for 4 years, 6 months
  • Last seen this week
  • Berlin, Deutschland
  • Meta user
  • Network profile
Profile Activity
  • Summary
  • Answers
  • Questions
  • Tags
  • Badges
  • Bookmarks
  • Bounties
  • Reputation
  • All actions

6 Questions

Score Activity Newest Views
8 votes
0 answers
156 views

Compute the expected size of an approximation of vertex cover

graphs approximation probability-theory randomized-algorithms vertex-cover
asked Jan 2, 2020 at 5:28
5 votes
1 answer
340 views

An example where the algorithm of Hopcroft and Karp performs poorly?

algorithms graphs lower-bounds bipartite-matching fine-grained-analysis
asked Oct 30, 2019 at 2:20
4 votes
1 answer
81 views

Conditional lower bounds on the running time of the single source shortest path problem

graphs shortest-path polynomial-time lower-bounds fine-grained-analysis
asked Oct 20, 2019 at 22:51
3 votes
1 answer
859 views

Expected length of a random walk on a line

algorithms probability-theory randomized-algorithms 2-sat random-walks
asked Jan 8, 2020 at 8:40
2 votes
1 answer
199 views

Hardness of a scheduling/assignment problem

algorithms reductions np-hard scheduling bipartite-matching
asked Feb 22, 2020 at 3:19
2 votes
1 answer
185 views

Polynomial multiplications and counting

algorithms combinatorics polynomials fast-fourier-transform
asked Oct 27, 2019 at 13:14
Computer Science
  • Tour
  • Help
  • Chat
  • Contact
  • Feedback
Company
  • Stack Overflow
  • Teams
  • Advertising
  • Collectives
  • Talent
  • About
  • Press
  • Legal
  • Privacy Policy
  • Terms of Service
  • Cookie Settings
  • Cookie Policy
Stack Exchange Network
  • Technology
  • Culture & recreation
  • Life & arts
  • Science
  • Professional
  • Business
  • API
  • Data
  • Blog
  • Facebook
  • Twitter
  • LinkedIn
  • Instagram

Site design / logo © 2022 Stack Exchange Inc; user contributions licensed under CC BY-SA. rev 2022.8.12.42806

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.