Continue to Site

Welcome to EDAboard.com

Welcome to our site! EDAboard.com is an international Electronics Discussion Forum focused on EDA software, circuits, schematics, books, theory, papers, asic, pld, 8051, DSP, Network, RF, Analog Design, PCB, Service Manuals... and a whole lot more! To participate you need to register. Registration is free. Click here to register now.

Register Log in

Is it possible to find the complexity, e.g., O(n) etc., of non closed form solutions

Status
Not open for further replies.
W

wajahat

Advanced Member level 4
Joined
Feb 3, 2006
Messages
102
Helped
3
Reputation
6
Reaction score
1
Trophy points
1,298
Activity points
2,097
Hi all,

I want to find the complexity of problems with no closed form solution. Is it possible?

For example, finding the intersection area of N circles has a non closed form solution. It is solved using monte carlo methods.
Is possible to find the complexity of solution. With complexity i mean O(N) expression.

I can run different simulations and record the simulation time for different number of circles.
Is it possible to calculate this complexity expression from these simulation times? As i can't run simulation for every N.

regards
wajahat
 

Status
Not open for further replies.

Similar threads

Part and Inventory Search

Welcome to EDABoard.com

Sponsor

Back
Top